Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size
On the upper bound of the size of the r-cover-free families
✍ Scribed by Miklós Ruszinkó
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 311 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let D be a finite family of k-subsets (called blocks) of a v-set X(v). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks is the size of the covering, and the minimum size of the covering is called the covering nu
We give an exponential upper bound in p 4 on the size of any obstruction for path-width at most p. We give a doubly exponential upper bound in k 5 on the size of any obstruction for tree-width at most k. We also give an upper bound on the size of any intertwine of two given trees T and T $. The boun
Expressions mo derived that bound from above the Helmhoitz free energy of a &as&cat system. Letf be the Helmholta free energy per particle, p \*he number density, andg(r) the pair fra-dial} distribution function of a classical singiespecies system, the energy of which is a sum of one-body and two-b