Some problems about \(r\)-factorizations of complete graphs (Q2708238)
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: Some problems about \(r\)-factorizations of complete graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some problems about \(r\)-factorizations of complete graphs |
scientific article |
Statements
8 July 2001
0 references
factorization
0 references
2-factorization
0 references
\(r\)-factorization
0 references
complete graph
0 references
Some problems about \(r\)-factorizations of complete graphs (English)
0 references
The authors show that the complete graph \(K_{2n+1}\) has a 2-factorization in which all 2-factors are non-isomorphic. Furthermore, they show that \(K_{rn+1}\), where \(r\geq 3\), has an \(r\)-factorization in which the \(r\)-factors are all \(r\)-connected and the number of isomorphism classes in which the \(r\)-factors lie is either 2 or 3.
0 references
