Cycles of given size in a dense graph

Abstract

We generalise a result of Corrádi and Hajnal and show that every graph with average degree at least $\frac{4}{3}kr$ contains $k$ vertex disjoint cycles, each of order at least $r$, as long as $k\ge 6$. This bound is sharp when $r=3$.

15 pages