The decomposition of \(K_v\) into \(K_2\times K_5\)'s

DOI10.1007/s11425-007-0079-3zbMath1128.05003OpenAlexW2143438935MaRDI QIDQ2464312

Gennian Ge, Jianxing Yin, Rucong Zhang, Yang Li

Publication date: 19 December 2007

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0079-3

zbMATH Keywords

decompositionDNA library screening

Mathematics Subject Classification ID

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

Related Items

The existence of \((K_2\times K_6)\)-designs ⋮ Grid-block difference families and related combinatorial structures ⋮ The existence of \((2 \times c, \lambda )\) grid-block designs with \({c\in \{3, 4, 5\}}\) and \(\lambda \geq 1\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairwise balanced designs with consecutive block sizes
• Packing of \(K_{v}\) with certain graphs of five vertices
• Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
• A survey on maximum distance holey packings
• A resolvable \(r \times c\) grid-block packing and its application to DNA library screening
• Constructions of optimal packing designs
• The Existence of 2×4 Grid-Block Designs and Their Applications
• An isomorphic factorization of the complete graph
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS