Skolem-type difference sets for cycle systems
The electronic journal of combinatorics, Tome 10 (2003)
Cyclic $m$-cycle systems of order $v$ are constructed for all $m\geq 3$, and all $v\equiv 1(\hbox{mod }2m)$. This result has been settled previously by several authors. In this paper, we provide a different solution, as a consequence of a more general result, which handles all cases using similar methods and which also allows us to prove necessary and sufficient conditions for the existence of a cyclic $m$-cycle system of $K_v-F$ for all $m\geq 3$, and all $v\equiv 2(\hbox{mod }2m)$.
@article{10_37236_1731,
author = {Darryn Bryant and Heather Gavlas and Alan C. H. Ling},
title = {Skolem-type difference sets for cycle systems},
journal = {The electronic journal of combinatorics},
year = {2003},
volume = {10},
doi = {10.37236/1731},
zbl = {1031.05102},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1731/}
}
Darryn Bryant; Heather Gavlas; Alan C. H. Ling. Skolem-type difference sets for cycle systems. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1731
Cité par Sources :