Article contents
Infinite Classes of Covering Numbers
Published online by Cambridge University Press: 20 November 2018
Abstract
Let $D$ be a family of
$k$-subsets (called blocks) of a
$v$-set
$X\left( v \right)$. Then
$D$ is a
$\left( v,\,k,\,t \right)$ covering design or covering if every
$t$-subset of
$X\left( v \right)$ 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 consider the case
$t\,=\,2$, and find several infinite classes of covering numbers. We also give upper bounds on other classes of covering numbers.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 2000
References
- 3
- Cited by