Determination of the packing number \(D_{\lambda }(3,W_4^{(3)},\nu )\)

DOI10.1007/s11425-009-0176-6zbMath1177.05025OpenAlexW2267287857MaRDI QIDQ1047876

Yan Wu, Yan Xun Chang

Publication date: 6 January 2010

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

Full work available at URL: https://doi.org/10.1007/s11425-009-0176-6

zbMATH Keywords

group divisible designuniform hypergraphpacking numbercandelabra systemhyperwheelmaximim packing problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

The existence spectrum of Meta\((K^{(3)}_{4} > K^{(3)}_{4} - e)\) ⋮ On the covering number \(c_\lambda(3,W_4^{(3)}, v)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Candelabra systems and designs
• Hypergraph decomposition and secret sharing
• The fundamental construction for 3-designs
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Decompositions of the 3-uniform hypergraphs \(K_{v}^{(3)}\) into hypergraphs of a certain type
• On Some Tactical Configurations

This page was built for publication: Determination of the packing number \(D_{\lambda }(3,W_4^{(3)},\nu )\)