A proof of the dense version of Lovász conjecture

Demetres Christofides, Jan Hladký, Andras Máthé
2011 Electronic Notes in Discrete Mathematics  
We prove that every sufficiently large dense connected vertex-transitive graph is Hamiltonian.
doi:10.1016/j.endm.2011.09.047 fatcat:mcxy7drphfav3mctn6y2yg2ika