The number of 4-cycles in 2-factorizations of \(K_{2n}\) minus a 1-factor (Q1567602): 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.1016/s0012-365x(99)00377-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026424358 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of 4-cycles in 2-factorizations of \(K_{2n}\) minus a 1-factor |
scientific article |
Statements
The number of 4-cycles in 2-factorizations of \(K_{2n}\) minus a 1-factor (English)
0 references
13 February 2001
0 references
For each positive integer \(n\), the authors determine all \(m\) so that there exists a 2-factorization of \(K_{2n} - F\), where \(F\) is a 1-factor, with exactly \(m\) 4-cycles.
0 references
complete graph
0 references
4-cycle
0 references
2-factorization
0 references
