Vertex-disjoint cycles of the same length (Q1924121)
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 934788
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex-disjoint cycles of the same length |
scientific article; zbMATH DE number 934788 |
Statements
Vertex-disjoint cycles of the same length (English)
0 references
14 October 1996
0 references
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.
0 references
minimum degree
0 references
order
0 references
cycles
0 references
