scientific article; zbMATH DE number 124521
From MaRDI portal
Publication:4026151
[For the entire collection see Zbl 0746.00028.] This is an absolutely outstanding survey, of the utmost use to any researcher in the field. The topics covered are: bounds, results for \(k\) and \(t\) fixed, results for a fixed number of blocks, results for small \(v\) and lambda equal to unity, results from finite geometries, related covering and packing results, isomorphisms results, asymptotic results, algorithms, open problems. There is a very complete and useful reference list of 110 papers, and the section on open problems is likewise very thought-provoking. The survey is an essential research tool.
Recommendations
- Packings and coverings
- scientific article; zbMATH DE number 3282420
- scientific article; zbMATH DE number 3282421
- scientific article; zbMATH DE number 3342063
- scientific article; zbMATH DE number 1182895
- scientific article; zbMATH DE number 682080
- scientific article; zbMATH DE number 874507
- scientific article; zbMATH DE number 3996526
- Packing and covering with non-piercing regions
- Packing and covering with non-piercing regions
Cited in
(53)- The minimum likely column cover problem
- Error-correcting codes from permutation groups
- Borsuk's covering for blunt bodies
- Single change covering designs
- Covering graphs: The covering problem solved
- Covers of some varietal products
- General upper bounds on the minimum size of covering designs
- The last packing number of quadruples, and cyclic SQS
- Some recent developments on BIBDs and related designs
- On \(\lambda\)-covers of pairs by quintuples: \(v\) odd
- Coverings versus entourages
- Rank inequalities and separation algorithms for packing designs and sparse triple systems.
- Existence of \((v,\{5,w^*\},1)\)-PBDs.
- Some \(t\)-designs are minimal \((t+1)\)-coverings
- A general construction for optimal cyclic packing designs
- Error-correcting codes from \(k\)-resolving sets
- Optimal covering designs: complexity results and new bounds
- On erasure combinatorial batch codes
- Packing pairs by quintuples: The case of zero congruence mod 4
- Quorum systems constructed from combinatorial designs
- What we know and what we do not know about Turán numbers
- Suitable sets of permutations, packings of triples, and Ramsey's theorem
- On the constructive enumeration of packings and coverings of index one
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
- On the non-existence of pair covering designs with at least as many points as blocks
- Latin squares with bounded size of row prefix intersections
- Relations between the differential and parameters in graphs
- Bin packing with colocations
- An improvement on covering triples by quadruples
- scientific article; zbMATH DE number 3817719 (Why is no real title available?)
- Generalized packing designs
- A tabu search algorithm for the covering design problem
- scientific article; zbMATH DE number 1279039 (Why is no real title available?)
- Remoteness of permutation codes
- scientific article; zbMATH DE number 1182895 (Why is no real title available?)
- scientific article; zbMATH DE number 1947430 (Why is no real title available?)
- A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50
- scientific article; zbMATH DE number 2148698 (Why is no real title available?)
- Using symmetry to optimize over the Sherali-Adams relaxation
- scientific article; zbMATH DE number 810048 (Why is no real title available?)
- scientific article; zbMATH DE number 874507 (Why is no real title available?)
- scientific article; zbMATH DE number 874532 (Why is no real title available?)
- Leaves for packings with block size four
- The independent domination numbers of strong product of two cycles
- scientific article; zbMATH DE number 3342063 (Why is no real title available?)
- Packing designs with equal-sized holes
- Orbital branching
- New lower bounds for \(t\)-coverings
- Switching codes and designs
- Generalising Fisher's inequality to coverings and packings
- Packing designs with large block size
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
- Pair covering designs with block size 5
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4026151)
