Small embeddings for partial cycle systems of odd length (Q2639071): Difference between revisions

A partial m-cycle system on n vertices is a collection \({\mathcal C}\) of edge-disjoint m-cycles in the graph \(K_ n\). Define by \(\rho\) (n,m) the smallest integer so that the edges of \(K_{\rho (n,m)}\) can be partitioned into m-cycles amongst which are the cycles of \({\mathcal C}\). It is known [\textit{R. M. Wilson}, Combinatorics, Part 1, Proc. advanced Study Inst., Breukelen, 18-41 (1974; Zbl 0312.05010)] that \(\rho\) (n,m) exists. In this paper it is shown that \(\rho (n,m)\leq m((m-2)n(n-1)+2n+1)\).