5,1

C(v,k,t) is the smallest number of k-subsets of an n-set such that every t-subset is contained in at least one of the k-subsets.

CRC Handbook of Combinatorial Designs, 1996, p. 263.

W. H. Mills and R. C. Mullin, Coverings and packings, pp. 371-399 of J. H. Dinitz and D. R. Stinson, editors,a Contemporary Design Theory, Wiley, 1992.

D. Gordon, La Jolla Repository of Coverings

K. J. Nurmela and P. R. J. Ostergard, New coverings of t-sets with (t+1)-sets, J. Combinat. Designs, 7 (1999), 217-226.

K. J. Nurmela and P. R. J. Ostergard, New coverings of t-sets with (t+1)-sets (appendix), J. Combinat. Designs, 7 (1999), 217-226.

Index entries for covering numbers

A column of A066010.

Sequence in context: A074899 A125851 A160732 this_sequence A061061 A001975 A096220

Adjacent sequences: A066137 A066138 A066139 this_sequence A066141 A066142 A066143

nonn

N. J. A. Sloane (njas(AT)research.att.com).