We show how to find in Hamiltonian graphs a cycle of length
n^{\Omega(1/\log\log n)}. This is a consequence of a more general
result in which we show that if G has maximum degree d and has a
cycle with k vertices (or a 3-cyclable minor H with k vertices),
then ... more >>>