Large sets of coverings
From MaRDI portal
Recommendations
Cites work
- Bounds on the sizes of constant weight covering codes
- Construction of Large Sets of Almost Disjoint Steiner Triple Systems
- scientific article; zbMATH DE number 124524 (Why is no real title available?)
- Minimal coverings of pairs by triples
- On certain distributions of integers in pairs with given differences
- On coverings
- On Quadruple Systems
- Verification of a Conjecture of Th. Skolem.
Cited in
(17)- General upper bounds on the minimum size of covering designs
- Overlarge sets and partial geometries
- Optimal covering designs: complexity results and new bounds
- Bounds on the sizes of constant weight covering codes
- Bounds for optimal coverings
- On the chromatic number, colorings, and codes of the Johnson graph
- TBSs in some minimum coverings
- Upper bounds on the general covering numberCλ(v,k,t,m)
- scientific article; zbMATH DE number 3873349 (Why is no real title available?)
- Large Intersections of Large Sets
- scientific article; zbMATH DE number 1107517 (Why is no real title available?)
- Big Sets
- Equitable resolvable coverings
- scientific article; zbMATH DE number 800301 (Why is no real title available?)
- scientific article; zbMATH DE number 7640035 (Why is no real title available?)
- Asymptotic bounds for general covering designs
- Existence of large sets of coverings with block size 3
This page was built for publication: Large sets of coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764667)
