Constructing designs straightforwardly: Worst arising cases
A \(t\)-\((v,k,\lambda)\) packing (covering) design \(D\) is a collection of \(k\)-element sets, called blocks, out of a \(v\)-set such that each \(t\)-subset of the \(v\)-set is contained in at most (at least) \(\lambda\) blocks. Generally, one is interested in maximizing (minimizing) the size of a packing (covering) design with given parameters, but other questions may be posed as well. In the current paper, the problems of finding the minimum size of a maximal packing and the maximum size of a minimal covering are considered. A packing is maximal if it is not possible to add further blocks without violating the packing criterion; a minimal covering is defined in an analogous way. The results obtained give worst-case bounds for the sizes of designs constructed, for example, by any greedy algorithm.
- A class of constructions for Turan's (3,4)-problem
- A Remark on the Number of Complete and Empty Subgraphs
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Asymptotically optimal covering designs
- On a packing and covering problem
- On complete subgraphs of different orders
- Saturated graphs with minimal number of edges
- Supersaturated graphs and hypergraphs
- The Minimum Size of Saturated Hypergraphs
- What we know and what we do not know about Turán numbers
- On worst case design strategies
- Rank inequalities and separation algorithms for packing designs and sparse triple systems.
- Saturation numbers for disjoint stars
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
- Generalized covering designs and clique coverings
- scientific article; zbMATH DE number 54794 (Why is no real title available?)
- Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
- scientific article; zbMATH DE number 1405802 (Why is no real title available?)
- Design by example: An application of Armstrong relations
This page was built for publication: Constructing designs straightforwardly: Worst arising cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2713359)
