Vertex-disjoint cycles of the same length (Q1924121): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1996.0015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015810078 / rank | |||
Normal rank | |||
Latest revision as of 23:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex-disjoint cycles of the same length |
scientific article |
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
