Linear circumference in vertex-transitive graphs

Abstract

We prove that there is an absolute constant $c>0$ such that every connected vertex-transitive graph $G$ on $n \ge 3$ vertices contains a cycle of length at least $cn$. Moreover, every such graph with sufficiently large degree $d$ contains a cycle of length at least $(1-d^{-1/100})n$. This gives the first linear bound towards Lov\'asz's Hamiltonicity conjecture. The proof combines a structural result of DeVos and Mohar on vertex-transitive graphs with a general framework for finding long cycles, which may be of independent interest.