Matches in DBpedia 2015-10 for { ?s ?p "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."@en }
Showing triples 1 to 1 of
1
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.".