Vertex-disjoint cycles of the same length. (Q1405099)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Vertex-disjoint cycles of the same length. |
scientific article; zbMATH DE number 1970675
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex-disjoint cycles of the same length. |
scientific article; zbMATH DE number 1970675 |
Statements
Vertex-disjoint cycles of the same length. (English)
0 references
25 August 2003
0 references
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.
0 references
