scientific article; zbMATH DE number 1066163

From MaRDI portal
Publication:4357347





An \(m\)-cycle system of order \(n\) is a pair \((S,C)\) where \(C\) is an edge-disjoint collection of cycles of length \(m\) which partition the edge set of a complete graph \(K_n\) with vertex set \(S\), \(| S| =n\). A partial \(n\)-cycle system of order \(n\) is a pair \((S,P)\) where \(S\) is as above and \(P\) is a collection of edge-disjoint \(m\)-cycles of \(K_n\) (not necessarily including all of the edges of \(K_n\)). It is well known that a partial \(m\)-cycle system of order \(n\) can be embedded in an \(m\)-cycle system of order \(m(2n+1)\) when \(m\) is odd, and in an \(m\)-cycle system of order \(2nm+1\) if \(m\) is even. The article is a nice survey of the techniques used to obtain these embeddings. For the entire collection see [Zbl 0871.00034].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4357347)