Asymptotic Bounds for General Covering Designs
From MaRDI portal
Publication:5175786
DOI10.1002/jcd.21401zbMath1309.05041MaRDI QIDQ5175786
Publication date: 25 February 2015
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21401
05B30: Other designs, configurations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some constructions of general covering designs
- Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems)
- Minimal coverings of pairs by triples
- On large sets of disjoint Steiner triple systems. IV
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
- On large sets of disjoint Steiner triple systems. III
- A note on the probabilistic approach to Turan's problem
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Some new 2-resolvable Steiner quadruple systems
- Nearly perfect matchings in regular simple hypergraphs
- Optimal covering designs: complexity results and new bounds
- Bounds on the sizes of constant weight covering codes
- What we know and what we do not know about Turán numbers
- On the covering of pairs by quadruples. I
- On the covering of pairs by quadruples. II
- On resolvable designs
- Generalized covering designs and clique coverings
- Upper bounds on the general covering numberCλ(v,k,t,m)
- A new table of constant weight codes
- New lower bounds for constant weight codes
- On the lottery problem
- New constructions for covering designs
- Large sets of coverings
- The lotto numbers L(n,3,p,2)
- Existence of large sets of coverings with block size 3
- Upper bounds for Turán numbers
