## Abstract The necessary and sufficient conditions for the existence of a 1‐rotational __k__‐cycle system of the complete graph __K__~__v__~ are established. The proof provides an algorithm able to determine, directly and explicitly, an odd __k__‐cycle system of __K__~__v__~ whenever such a system
Rotational k-cycle systems of order v k; another proof of the existence of odd cycle systems
✍ Scribed by Marco Buratti
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 112 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We give an explicit solution to the existence problem for 1‐rotational k‐cycle systems of order v < 3__k__ with k odd and v ≠ 2__k__ + 1. We also exhibit a 2‐rotational k‐cycle system of order 2__k__ + 1 for any odd k. Thus, for k odd and any admissible v < 3__k__ there exists a 2‐rotational k‐cycle system of order v. This may also be viewed as an alternative proof that the obvious necessary conditions for the existence of odd cycle systems are also sufficient. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 433–441, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10061
📜 SIMILAR VOLUMES
## Abstract We exhibit cyclic (__K~v~__, __C~k~__)‐designs with __v__ > __k__, __v__ ≡ __k__ (mod 2__k__), for __k__ an odd prime power but not a prime, and for __k__ = 15. Such values were the only ones not to be analyzed yet, under the hypothesis __v__ ≡ __k__ (mod 2__k__). Our construction avail