  Bryant, Horsley, Maenhaut and Smith recently gave necessary and sufficient
conditions for when the complete multigraph can be decomposed into cycles of
specified lengths $m_1,m_2,\ldots,m_\tau$. In this paper we characterise
exactly when there exists a packing of the complete multigraph with cycles of
specified lengths $m_1,m_2,\ldots,m_\tau$. While cycle decompositions can give
rise to packings by removing cycles from the decomposition, in general it is
not known when there exists a packing of the complete multigraph with cycles of
various specified lengths.
