The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles

DOI10.1016/S0012-365X(97)00080-0zbMath0901.05029OpenAlexW2048500767MaRDI QIDQ1382820

Charles C. Lindner, Hung-Lin Fu

Publication date: 18 March 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00080-0

zbMATH Keywords

embeddingstriple systemscomplete graphleavemaximum packingDoyen-Wilson theorem

Mathematics Subject Classification ID

Other designs, configurations (05B30) Triple systems (05B07) Combinatorial aspects of packing and covering (05B40)

Related Items

The Doyen--Wilson theorem for kite systems ⋮ The Doyen-Wilson theorem for 3-sun systems ⋮ Constructions of optimal packing and covering of the complete multigraph with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Partial triple systems and edge colourings
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Embeddings of Steiner triple systems
• Packing and Covering of the Complete Graph with 4-Cycles^*
• The Doyen?Wilson theorem for minimum coverings with triples
• On the doyen‐wilson theorem for m‐cycle systems