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