The existence of \((2 \times c, \lambda )\) grid-block designs with \({c\in \{3, 4, 5\}}\) and \(\lambda \geq 1\)

DOI10.1007/s00010-012-0140-3zbMath1260.05028OpenAlexW2168475380MaRDI QIDQ1941993

Jie Yan

Publication date: 25 March 2013

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00010-012-0140-3

zbMATH Keywords

decompositionCartesian productcomplete graphgrid-block design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
• The decomposition of \(K_v\) into \(K_2\times K_5\)'s
• The Existence of $r\times4$ Grid-Block Designs with $r=3,4$
• Resolvable packings ofKvwithK₂ × Kc's
• The Existence of 2×4 Grid-Block Designs and Their Applications

This page was built for publication: The existence of \((2 \times c, \lambda )\) grid-block designs with \({c\in \{3, 4, 5\}}\) and \(\lambda \geq 1\)