Cycles of given size in a dense graph

Daniel J. Harvey, David R. Wood

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$…