Disjoint long cycles in a graph

We prove that if G is a graph of order at least 2k with k ⩾ 9 and the minimum degree of G is at least k + 1, then G contains two vertex-disjoint cycles of order at least k. Moreover, the condition on the minimum degree is sharp.