Lovász conjecture on Hamiltonian paths
Does every finite connected vertex-transitive graph have a path that visits each vertex exactly once?
Summary
László Lovász raised the question in 1969; the search for such paths in highly symmetric graphs goes back to bell-ringing. In 1996 László Babai published a conjecture sharply contradicting it, and both conjectures remain open; only five connected vertex-transitive graphs without a Hamiltonian cycle are known.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.