The Doyen-Wilson theorem extended to 5-cycles

DOI10.1016/0097-3165(94)90101-5zbMath0809.05019MaRDI QIDQ1336451

Darryn E. Bryant, C. A. Rodger

Publication date: 22 November 1994

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90101-5

zbMATH Keywords

embedding; Steiner triple system; 5-cycle system; Doyen-Wilson theorem; \(m\)-cycle system

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05B07: Triple systems

Related Items

5-cycle systems with holes, A generalization of the Doyen-Wilson theorem for extended triple systems of all indices, Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)

Cites Work

• A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• The embedding of partial triple systems when 4 divides \(\lambda\)
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Embeddings of Steiner triple systems
• Small embeddings for partial cycle systems of odd length
• Embedding Partial Steiner Triple Systems
• The chromatic index of complete multipartite graphs
• Embedding directed and undirected partial cycle systems of index λ > 1
• On the doyen‐wilson theorem for m‐cycle systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item