Pancyclicity of Hamiltonian and highly connected graphs

Peter Keevash, Benny Sudakov

A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length $\ell$ for all $3\le \ell \le n$. Write $\alpha (G)$ for the inde…