Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.

DOI10.1016/S0378-3758(02)00421-4zbMath1035.05028MaRDI QIDQ1417807

Frank K. Hwang, Hung-Lin Fu, Chin-Lin Shiue, Yukiyasu Mutoh, Masakazu Jimbo

Publication date: 6 January 2004

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

group divisible designSteiner systemgrid-block

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Improving the existence bounds for grid-block difference families ⋮ 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\) ⋮ The decomposition of \(K_v\) into \(K_2\times K_5\)'s

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a composition of cyclic 2-designs
• Recursive constructions for cyclic block designs
• Product constructions for cyclic block designs. II. Steiner 2-designs
• The Existence of 2×4 Grid-Block Designs and Their Applications
• Maximally Efficient Two‐Stage Screening
• An isomorphic factorization of the complete graph
• Preliminary Report on the Rectangular Lattices

This page was built for publication: Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.