scientific article; zbMATH DE number 124521
From MaRDI portal
Publication:4026151
zbMATH Open0783.05038MaRDI QIDQ4026151FDOQ4026151
Authors:
Publication date: 21 February 1993
Title of this publication is not available (Why is that?)
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
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of packing and covering (05B40)
Cited In (51)
- Quorum systems constructed from combinatorial designs
- Rank inequalities and separation algorithms for packing designs and sparse triple systems.
- Switching codes and designs
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
- Borsuk's covering for blunt bodies
- Covering graphs: The covering problem solved
- New lower bounds for \(t\)-coverings
- Title not available (Why is that?)
- Some recent developments on BIBDs and related designs
- Relations between the differential and parameters in graphs
- Pair covering designs with block size 5
- Suitable sets of permutations, packings of triples, and Ramsey's theorem
- Remoteness of permutation codes
- Existence of \((v,\{5,w^*\},1)\)-PBDs.
- Covers of some varietal products
- Title not available (Why is that?)
- On \(\lambda\)-covers of pairs by quintuples: \(v\) odd
- Coverings versus entourages
- What we know and what we do not know about Turán numbers
- Leaves for packings with block size four
- Packing pairs by quintuples: The case of zero congruence mod 4
- General upper bounds on the minimum size of covering designs
- Orbital branching
- Generalized packing designs
- Title not available (Why is that?)
- Optimal covering designs: complexity results and new bounds
- An improvement on covering triples by quadruples
- Title not available (Why is that?)
- Title not available (Why is that?)
- Latin squares with bounded size of row prefix intersections
- The last packing number of quadruples, and cyclic SQS
- The minimum likely column cover problem
- Title not available (Why is that?)
- The independent domination numbers of strong product of two cycles
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
- Using symmetry to optimize over the Sherali-Adams relaxation
- A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50
- On the non-existence of pair covering designs with at least as many points as blocks
- Packing designs with equal-sized holes
- A general construction for optimal cyclic packing designs
- Bin Packing with Colocations
- Title not available (Why is that?)
- Single change covering designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On erasure combinatorial batch codes
- A tabu search algorithm for the covering design problem
- Error-correcting codes from permutation groups
- Some \(t\)-designs are minimal \((t+1)\)-coverings
- Generalising Fisher's inequality to coverings and packings
- Error-correcting codes from \(k\)-resolving sets
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)
