Decompositions of complete graphs into cycles of arbitrary lengths

Darryn Bryant, Daniel Horsley, William Pettersson

We show that the complete graph on $n$ vertices can be decomposed into $t$ cycles of specified lengths $m_1,\dots ,m_t$ if and only if $n$ is odd, $3\le m_i\le n$ for $i=1,\ldots…