Large sets of coverings

DOI10.1002/jcd.3180020509zbMath0833.05021OpenAlexW2131361680MaRDI QIDQ4764667

Tuvi Etzion

Publication date: 11 March 1996

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.3180020509

zbMATH Keywords

boundsblockscoveringslarge sets

Mathematics Subject Classification ID

Triple systems (05B07) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

Upper bounds on the general covering numberC_λ(v,k,t,m) ⋮ On the chromatic number, colorings, and codes of the Johnson graph ⋮ Optimal covering designs: complexity results and new bounds ⋮ Asymptotic Bounds for General Covering Designs ⋮ Bounds on the sizes of constant weight covering codes ⋮ General upper bounds on the minimum size of covering designs

Cites Work

• Unnamed Item
• Minimal coverings of pairs by triples
• Bounds on the sizes of constant weight covering codes
• On coverings
• On certain distributions of integers in pairs with given differences
• On Quadruple Systems
• Verification of a Conjecture of Th. Skolem.
• Construction of Large Sets of Almost Disjoint Steiner Triple Systems

This page was built for publication: Large sets of coverings