A nearly linear bound for the Lov\'asz conjecture
The celebrated conjecture of Lov\'asz from 1969 asks whether every connected vertex-transitive graph has a Hamiltonian path. Buci\'c, Christoph, Pokrovskiy and Steiner recently proved that every such graph on $n$ vertices contains a cycle of length $n^{2/3-o(1)}$. In this paper, we improve this bound to $n^{1-o(1)}$. O...