Name
Abstract | ||
|---|---|---|
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 number. In this paper we find new upper bounds on the covering numbers for several families of parameters. (C) 1999 Academic Press. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1006/jcta.1998.2927 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
upper bound | Discrete mathematics,Combinatorics,Covering number,Mathematics | Journal |
Volume | Issue | ISSN |
86 | 2 | 0097-3165 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| iliya bluskov | 1 | 7 | 3.88 |
| Katherine Heinrich | 2 | 0 | 0.34 |