Nothing Special   »   [go: up one dir, main page]

An Entity of Type: disease, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive graph contains a Hamiltonian path. Originally László Lovász stated the problem in the opposite way, butthis version became standard. In 1996, László Babai published a conjecture sharply contradicting this conjecture, but both conjectures remain widely open. It is not even known if a single counterexample would necessarily lead to a series of counterexamples.

Property Value
dbo:abstract
  • In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive graph contains a Hamiltonian path. Originally László Lovász stated the problem in the opposite way, butthis version became standard. In 1996, László Babai published a conjecture sharply contradicting this conjecture, but both conjectures remain widely open. It is not even known if a single counterexample would necessarily lead to a series of counterexamples. (en)
  • Гипотеза Ловаса о гамильтоновом цикле — классическая гипотеза в теории графов. Сформулирована в четвёртом томе «Искусства программирования», но, скорее всего, была известна гораздо раньше. (ru)
  • Гіпо́теза Ло́васа про гамільто́нів цикл — класична гіпотеза в теорії графів. Сформульована в четвертому томі «Мистецтва програмування», але, найпевніше, була відома значно раніше. (uk)
dbo:thumbnail
dbo:wikiPageID
  • 4367424 (xsd:integer)
dbo:wikiPageLength
  • 7889 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1062224519 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdf:type
rdfs:comment
  • In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive graph contains a Hamiltonian path. Originally László Lovász stated the problem in the opposite way, butthis version became standard. In 1996, László Babai published a conjecture sharply contradicting this conjecture, but both conjectures remain widely open. It is not even known if a single counterexample would necessarily lead to a series of counterexamples. (en)
  • Гипотеза Ловаса о гамильтоновом цикле — классическая гипотеза в теории графов. Сформулирована в четвёртом томе «Искусства программирования», но, скорее всего, была известна гораздо раньше. (ru)
  • Гіпо́теза Ло́васа про гамільто́нів цикл — класична гіпотеза в теорії графів. Сформульована в четвертому томі «Мистецтва програмування», але, найпевніше, була відома значно раніше. (uk)
rdfs:label
  • Lovász conjecture (en)
  • Гипотеза Ловаса о гамильтоновом цикле (ru)
  • Гіпотеза Ловаса про гамільтонів цикл (uk)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License