On balanced incomplete block designs with specified weak chromatic number

DOI10.1016/j.jcta.2013.12.004zbMath1281.05021arXiv1209.6111OpenAlexW2036754114MaRDI QIDQ2434889

Daniel Horsley, David A. Pike

Publication date: 31 January 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.6111

zbMATH Keywords

blocking setblock designweak chromatic numberweak colouring

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Unnamed Item ⋮ Equitably Colored Balanced Incomplete Block Designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tripelsysteme mit Untersystemen
• Blocking sets in designs with block size four. II
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Two Doyen-Wilson theorems for maximum packings with triples
• Completing the spectrum of 2-chromatic \(S(2,4,v)\)
• Blocking sets in designs with block size 4
• On 2-chromatic \((v,5,1)\)-designs
• On cycle systems with specified weak chromatic number
• Decompositions of edge-colored complete graphs
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Coloring Steiner Triple Systems
• The Doyen?Wilson theorem for minimum coverings with triples
• Coloring BIBDs with block size 4
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems

This page was built for publication: On balanced incomplete block designs with specified weak chromatic number