A sufficient condition for all short cycles Original Research Article

Generalizing a result of Häggkvist et al. (1981), we prove that every non-bipartite graph of order n with more than (n − 1)24 + 1 edges contains cycles of every length between 3 and the length of a longest cycle.