Existence of 1-rotational \(k\)-cycle systems of the complete graph (Q1889839): Difference between revisions

A \(k\)-cyclic system of \(K_v\) is a set \({B}\) of \(k\)-cycles whose edges partition the edge set of \(K_v\), the complete graph on \(v\) vertices. If the vertex-set of \(K_v\) is \(Z_{v-1}\cup \{\infty \}\) and \((b_0+1, b_1+1, \dots , b_{k-1}+1) \in {B}\) whenever \((b_0, b_1, \dots, b_{k-1}) \in {B}\), then \({B}\) is \(1\)-rotational. In this article, the author uses Skolem sequences to prove the existence of \(1\)-rotational \(k\)-cyclic systems of the complete graph for two cases: (1) \(v \equiv 1 \pmod{2k}\), \(k\) is an odd composite number; (2) \(v \equiv k \pmod{2k}\), \(k\) is odd except for \(k=3\) and \(v\equiv 15, 21 \pmod{24}\).