A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
A proof of the dense version of Lovász conjecture
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