Leaves for packings with block size four

MaRDI QIDQ5000309zbMATH OpenFDO

Authors Peter Dukes, Tao Feng, Yanxun Chang

Publication date 12 July 2021

Full work available at URL https://arxiv.org/abs/1905.12151, http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p281.pdf

zbMATH Keywords

maximum packingsleaves in a packing

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: We consider maximum packings of edge-disjoint $4$-cliques in the complete graph $K_n$. When $nequiv1$ or $4pmod12$, these are simply block designs. In other congruence classes, there are necessarily uncovered edges; we examine the possible `leave' graphs induced by those edges. We give particular emphasis to the case $nequiv0$ or $3pmod12$, when the leave is $2$-regular. Colbourn and Ling settled the case of Hamiltonian leaves in this case. We extend their construction and use several additional direct and recursive constructions to realize a variety of $2$-regular leaves. For various subsets $Ssubseteq3,4,5,dots$, we establish explicit lower bounds on $n$ to guarantee the existence of maximum packings with any possible leave whose cycle lengths belong to $S$.

Recommendations

• Packing complete multipartite graphs with 4-cycles
• Some results on 4-cycle packings.
• Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
• Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
• Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles

Cites work

• scientific article; zbMATH DE number 4110702 (Why is no real title available?)
• scientific article; zbMATH DE number 124521 (Why is no real title available?)
• scientific article; zbMATH DE number 3487460 (Why is no real title available?)
• scientific article; zbMATH DE number 1355275 (Why is no real title available?)
• A symmetric function generalization of the chromatic polynomial of a graph
• Covering and packing for pairs
• Edge-decompositions of graphs with high minimum degree
• Graph divisible designs and packing constructions
• Graph-Theoretic Concepts in Computer Science
• Group divisible designs with block size 4 and type \(g^um^1\)
• Group divisible designs with block size four and group type g^um^1
• Group divisible designs with block size four and group type \(g^um^{1}\) where \(g\) is a multiple of 8
• Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
• Group divisible designs with block size four and type \(g^um^1\). II
• Group divisible designs with block-size four
• HGDDs with block size four.
• Matching divisible designs with block size four
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• Packing graphs: The packing problem solved
• The existence of HGDDs with block size four and its application to double frames

Cited in

(3)

• Kite-group divisible packings and coverings with any minimum leave and minimum excess
• Maximum group divisible packings with block size four
• Group divisible (K₄-e)-packings with any minimum leave

This page was built for publication: Leaves for packings with block size four

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