## 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
Cyclic k-cycle systems of order 2kn + k: A solution of the last open cases
✍ Scribed by Andrea Vietri
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 144 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
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 avails of Rosa sequences and approximates the Hamiltonian case (v = k), which is known to admit no cyclic design with the same values of k. As a particular consequence, we settle the existence question for cyclic (K~v~, C~k~)‐designs with k a prime power. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 299–310, 2004.
📜 SIMILAR VOLUMES
## Abstract The solution structure of contryphan‐Vn, a cyclic peptide with a double cysteine S–S bridge and containing a D‐tryptophan extracted from the venom of the cone snail __Conus ventricosus__, has been determined by NMR spectroscopy using a variety of homonuclear and heteronuclear NMR method