Vertex-Disjoint Cycles of the Same Length

We show that for each integerk⩾3, there exists an integerpksuch that every graph with minimum degree at least 2kand order at leastpkcontainskpairwise vertex-disjoint cycles of the same length.