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

The paper proves the following result. Theorem: Let \(k\) be a natural number. Then there exists \(n_k\) such that if \(G\) is a graph of minimum degree at least \(2k\) and order at least \(n_k\), then \(G\) contains \(k\) disjoint cycles of the same length. As a consequence the truth of a 1983 conjecture due to Thomassen is verified and a conjecture of Häggkvist of similar age is verified by letting \(k= 2\) in the statement of the theorem.