Title of article
A proof of the dense version of Lovلsz conjecture
Author/Authors
Christofides، نويسنده , , Demetres and Hladk، نويسنده , , Jan and Mلthé، نويسنده , , Andras، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
285
To page
290
Abstract
We prove that every sufficiently large dense connected vertex-transitive graph is Hamiltonian.
Keywords
Regularity lemma , Lovلsz conjecture , Hamilton cycles
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455825
Link To Document