Cycles of given size in a dense graph

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

No reviews yet.

No comments yet.