A partial \(2k\)-cycle system of order \(n\) can be embedded in a \(2k\)-cycle system of order \(kn+c(k),k\geqslant 3\), where \(c(k)\) is a quadratic function of \(k\)

DOI10.1016/S0012-365X(02)00477-6zbMath1008.05079OpenAlexW1495601609MaRDI QIDQ1861299

C. A. Rodger, D. G. Hoffman, Charles C. Lindner

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00477-6

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Small embeddings for partial 5-cycle systems ⋮ Completing partial packings of bipartite graphs ⋮ On cycle systems with specified weak chromatic number ⋮ Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes ⋮ Tight embeddings of partial quadrilateral packings ⋮ Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge

This page was built for publication: A partial \(2k\)-cycle system of order \(n\) can be embedded in a \(2k\)-cycle system of order \(kn+c(k),k\geqslant 3\), where \(c(k)\) is a quadratic function of \(k\)