Lovasz Conjecture

The Lovasz conjecture (1969), in graph theory, is a classical problem on Hamiltonian paths. It states that every finite connected vertex-transitive graph contains a Hamiltonian path; Laszlo Lovasz originally stated the problem in the opposite direction, but this version became the standard one. In 1996, Laszlo Babai published a conjecture sharply contradicting it, and both conjectures remain widely open; it is not even known whether a single counterexample would necessarily lead to a whole series of counterexamples. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/