Lovász's Hamiltonicity conjecture for vertex-transitive graphs
Statement
A graph is vertex transitive if, for every pair of vertices , there is a graph automorphism mapping to . A graph is Hamiltonian if it admits a Hamiltonian circuit, namely a simple circuit containing every vertex of the graph. Lovász's conjecture. All but a finite number of vertex-transitive graphs are Hamiltonian. It remains open whether the remaining odd graphs are Hamiltonian; this conjecture is therefore unresolved in general.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.