Almost resolvable maximum packings of complete graphs with 5-cycles

DOI10.1007/S11464-015-0425-7MaRDI QIDQ893340zbMATHOpenAlexFDO

Authors Min Zhou, H. Cao

Publication date 19 November 2015

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11464-015-0425-7

zbMATH Keywords

cycle packingcycle frameresolvable maximum cycle packing

Mathematics Subject Classification ID

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

Recommendations

• Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
• Almost resolvable maximum packings of complete graphs with 4-cycles
• Maximum packings with odd cycles
• Packing complete multipartite graphs with 4-cycles
• On the existence of maximum resolvable (\(K_{4} - e\))-packings

Cites work

• scientific article; zbMATH DE number 5976587 (Why is no real title available?)
• scientific article; zbMATH DE number 3910402 (Why is no real title available?)
• scientific article; zbMATH DE number 124520 (Why is no real title available?)
• scientific article; zbMATH DE number 874490 (Why is no real title available?)
• scientific article; zbMATH DE number 1394637 (Why is no real title available?)
• scientific article; zbMATH DE number 238427 (Why is no real title available?)
• A new class of group divisible designs with block size three
• Almost resolvable 4-cycle systems
• Almost resolvable cycle systems --an analogue of Hanani triple systems
• Almost resolvable maximum packings of complete graphs with 4-cycles
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Frames for Kirkman triple systems
• Hanani triple systems
• Maximum packings of the complete graph with uniform length cycles
• Maximum packings with odd cycles
• More results on cycle frames and almost resolvable cycle systems
• On the Oberwolfach problem OP\((5^a, s)\)
• On the existence of cycle frames and almost resolvable cycle systems
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Packing cycles in complete graphs
• Packing pentagons into complete graphs: How clumsy can you get?
• Resolvable group divisible designs with block size 3
• The Oberwolfach problem and factors of uniform odd length cycles
• The equipartite Oberwolfach problem with uniform tables
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The generalized almost resolvable cycle system problem
• The solution of the bipartite analogue of the Oberwolfach problem
• Two new direct product‐type constructions for resolvable group‐divisible designs

Cited in

(3)

• Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
• Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
• Maximizing five-cycles in \(K_r\)-free graphs

This page was built for publication: Almost resolvable maximum packings of complete graphs with 5-cycles

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