Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles (Q1399917): Difference between revisions

The authors settle completely the problem of decomposing the complete symmetric digraph of order \(n\), \(K_n*\). They show that for any positive integers \(m\) and \(n\) (\(2 \leq m \leq n\)), \(K_n*\) can be decomposed into directed cycles of length \(m\) if and only if \(m\) divides the number of arcs in \(K_n*\) and \((n,m) \not= (4,4), (6,3),(6,6)\). The careful reader will appreciate the (40 pages of) detail given to the cycle constructions. The use of circulant graphs somewhat enlivens the discussion.