Cycle-factorization of symmetric complete multipartite digraphs (Q1297459)

Let \(K_{n_1, n_2, \ldots , n_m}^*\) denote the complete symmetric multipartite graph with \(m\) parts of the sizes \( n_1\), \(n_2, \ldots , n_m\). In this note the author shows: (1) \(K_{n_1, n_2, n_3}^*\) has a directed 3-cycle factorization if and only if \(n_1 = n_2 = n_3 = n\). (2) \(K_{n_1, n_2, \ldots , n_m}^*\) has a directed \(2k\)-cycle factorization in which each \(2k\)-cycle lies entirely within a \(K_{n_i, n_j}^*\), if and only if \(n_1 = n_2 = \ldots = n_m \equiv 0 \pmod {k}\), \(m\) even, and \(n_1 = n_2 = \ldots = n_m \equiv 0 \pmod {2k}\), \(m\) odd.