Vertex-disjoint cycles of the same length (Q1924121): Difference between revisions

It is shown that for each integer \(k\geq 3\), there exists an integer \(p_k\) such that every graph with minimum degree at least \(2k\) and order at least \(p_k\) contains \(k\) pairwise vertex-disjoint cycles of the same length. The question of whether the same holds for \(k= 2\) remains open.