Keywords

#lovász_conjecture

Lovász conjecture

Problem in graph theory

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.

Wed 14th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Lovász conjecture Erdős–Faber–Lovász conjecture László Lovász Lovász List of mathematical conjectures Lovász–Woodall conjecture List of conjectures by Paul Erdős Hamiltonian path Mertens conjecture List of unsolved problems in mathematics
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.