Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Lovász_conjecture> ?p ?o }
Showing triples 1 to 73 of
73
with 100 triples 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 wikiPageLength "6618".
- Lovász_conjecture wikiPageOutDegree "41".
- Lovász_conjecture wikiPageRevisionID "646978422".
- Lovász_conjecture wikiPageWikiLink Abelian_group.
- Lovász_conjecture wikiPageWikiLink Category:Algebraic_graph_theory.
- Lovász_conjecture wikiPageWikiLink Category:Conjectures.
- Lovász_conjecture wikiPageWikiLink Category:Finite_groups.
- Lovász_conjecture wikiPageWikiLink Category:Graph_theory.
- Lovász_conjecture wikiPageWikiLink Category:Group_theory.
- Lovász_conjecture wikiPageWikiLink Category:Hamiltonian_paths_and_cycles.
- Lovász_conjecture wikiPageWikiLink Cayley_graph.
- Lovász_conjecture wikiPageWikiLink Change_ringing.
- Lovász_conjecture wikiPageWikiLink Classification_of_finite_simple_groups.
- Lovász_conjecture wikiPageWikiLink Complete_graph.
- Lovász_conjecture wikiPageWikiLink Coxeter_graph.
- Lovász_conjecture wikiPageWikiLink Coxeter_group.
- Lovász_conjecture wikiPageWikiLink Cube-connected_cycles.
- Lovász_conjecture wikiPageWikiLink Cyclic_permutation.
- Lovász_conjecture wikiPageWikiLink Dihedral_group.
- Lovász_conjecture wikiPageWikiLink Donald_Knuth.
- Lovász_conjecture wikiPageWikiLink Finite_group.
- Lovász_conjecture wikiPageWikiLink Generating_set_of_a_group.
- Lovász_conjecture wikiPageWikiLink Graph_theory.
- Lovász_conjecture wikiPageWikiLink Gray_code.
- Lovász_conjecture wikiPageWikiLink Hamiltonian_path.
- Lovász_conjecture wikiPageWikiLink Igor_Pak.
- Lovász_conjecture wikiPageWikiLink László_Babai.
- Lovász_conjecture wikiPageWikiLink László_Lovász.
- Lovász_conjecture wikiPageWikiLink P-group.
- Lovász_conjecture wikiPageWikiLink Petersen_graph.
- Lovász_conjecture wikiPageWikiLink Presentation_of_a_group.
- Lovász_conjecture wikiPageWikiLink Radoičić.
- Lovász_conjecture wikiPageWikiLink Rapaport-Strasser.
- Lovász_conjecture wikiPageWikiLink Robert_Alexander_Rankin.
- Lovász_conjecture wikiPageWikiLink Steinhaus–Johnson–Trotter_algorithm.
- Lovász_conjecture wikiPageWikiLink Symmetric_group.
- Lovász_conjecture wikiPageWikiLink The_Art_of_Computer_Programming.
- Lovász_conjecture wikiPageWikiLink Tree_(graph_theory).
- Lovász_conjecture wikiPageWikiLink United_Kingdom.
- Lovász_conjecture wikiPageWikiLink Vertex-transitive_graph.
- Lovász_conjecture wikiPageWikiLink Wreath_product.
- Lovász_conjecture wikiPageWikiLink File:Steinhaus-Johnson-Trotter-Permutohedron.svg.
- Lovász_conjecture wikiPageWikiLinkText "Lovász conjecture".
- Lovász_conjecture wikiPageUsesTemplate Template:Reflist.
- 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 hypernym Problem.
- Lovász_conjecture type Disease.
- Lovász_conjecture type Group.
- Lovász_conjecture type Combinatoric.
- Lovász_conjecture type Conjecture.
- Lovász_conjecture type Diacritic.
- Lovász_conjecture type Field.
- Lovász_conjecture type Group.
- Lovász_conjecture type Object.
- Lovász_conjecture type Redirect.
- Lovász_conjecture type Relation.
- Lovász_conjecture type Statement.
- Lovász_conjecture type Statement.
- 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 Q957938.
- Lovász_conjecture sameAs Lovász-sejtés.
- Lovász_conjecture sameAs m.0bzh7h.
- Lovász_conjecture sameAs Q957938.
- Lovász_conjecture wasDerivedFrom Lovász_conjecture?oldid=646978422.
- Lovász_conjecture isPrimaryTopicOf Lovász_conjecture.