Path and cycle decompositions of complete equipartite graphs: Four parts (Q1025923): Difference between revisions

It is proved that a complete equipartite graph with four partite sets of size \(m\) has an edge-disjoint decomposition into cycles of length \(k\) if and only if \(k\geq 3\), \(m\) is even, \(k\) divides \(6m^2\) and \(k\leq 4m\). It is also proved that a complete equipartite graph with four partite sets of an even size \(m\) has an edge-disjoint decomposition into paths of length \(k\) if and only if \(k\) divides \(6m^2\) and \(k<4m\).