Large sets of coverings
From MaRDI portal
Publication:4764667
DOI10.1002/jcd.3180020509zbMath0833.05021MaRDI QIDQ4764667
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
Related Items
Asymptotic Bounds for General Covering Designs, General upper bounds on the minimum size of covering designs, Optimal covering designs: complexity results and new bounds, Bounds on the sizes of constant weight covering codes, On the chromatic number, colorings, and codes of the Johnson graph, Upper bounds on the general covering numberCλ(v,k,t,m)
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