Existence of cyclic \(k\)-cycle systems of the complete graph (Q1861284): 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(02)00463-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2007349912 / rank | |||
Normal rank |
Latest revision as of 12:01, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Existence of cyclic \(k\)-cycle systems of the complete graph |
scientific article |
Statements
Existence of cyclic \(k\)-cycle systems of the complete graph (English)
0 references
16 March 2003
0 references
The existence problems for cyclic \(k\)-cycle systems of the complete graph \(K_v\) with \(k \equiv 1\) (mod \(2k\)) and of the complete \(m\)-partite graph \(K_{m \times k}\) with odd \(m\) and \(k\) are considered. The authors give explicit constructions for all admissible cases using Rosa and Skolem sequences for suitable parameters. In particular, they prove that a cyclic \(p\)-cycle system of \(K_v\) with prime \(p\) exists for all admissible values of \(p\) and \(v\) but \((p,v)=(3,9)\).
0 references
Rosa sequence
0 references
Skolem sequence
0 references