𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random coverings of thin sets

✍ Scribed by Svante Janson

Book ID
112741308
Publisher
Springer Netherlands
Year
1985
Tongue
English
Weight
369 KB
Volume
24
Category
Article
ISSN
0004-2080

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Large sets of coverings
Large sets of coverings
✍ Tuvi Etzion πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 699 KB

Large sets of packings were investigated extensively. Much less is known about the dual problem, Le., large sets of coverings. We examine two types of important questions in this context; what is the maximum number of disjoint optimal coverings? and what is the minimum number of optimal coverings fo

COVERINGS OF PAIRS BY k-SETS
COVERINGS OF PAIRS BY k-SETS
✍ R.G. Stanton (Manitoba); J.G. Kalbfleisch (Waterloo) πŸ“‚ Article πŸ“… 1970 πŸ› John Wiley and Sons 🌐 English βš– 121 KB
New coverings of t-sets with (t + 1)-set
New coverings of t-sets with (t + 1)-sets
✍ Kari J. Nurmela; Patric R. J. Γ–stergΓ₯rd πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 434 KB πŸ‘ 1 views

The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C(v, k, t). In this article, a computer search for finding good such covering designs, leading to new upper bounds on C(v, k, t), is considered. The search is facilitated by predeterm