Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Lovász_conjecture> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Lovász_conjecture abstract "In graph theory, the Lovász conjecture (1970) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive graph contains a Hamiltonian path.The original article of Lovász stated the result in the opposite, butthis version became standard. In 1996 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.".
- Lovász_conjecture wikiPageID "4367424".
- Lovász_conjecture wikiPageRevisionID "557648049".
- Lovász_conjecture subject Category:Algebraic_graph_theory.
- Lovász_conjecture subject Category:Conjectures.
- Lovász_conjecture subject Category:Finite_groups.
- Lovász_conjecture subject Category:Graph_theory.
- Lovász_conjecture subject Category:Group_theory.
- Lovász_conjecture subject Category:Hamiltonian_paths_and_cycles.
- Lovász_conjecture comment "In graph theory, the Lovász conjecture (1970) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive graph contains a Hamiltonian path.The original article of Lovász stated the result in the opposite, butthis version became standard.".
- Lovász_conjecture label "Lovász conjecture".
- Lovász_conjecture sameAs Lov%C3%A1sz_conjecture.
- Lovász_conjecture sameAs Q957938.
- Lovász_conjecture sameAs Q957938.
- Lovász_conjecture wasDerivedFrom Lovász_conjecture?oldid=557648049.