Infinite Classes of Covering Numbers
Canadian mathematical bulletin, Tome 43 (2000) no. 4, pp. 385-396
Voir la notice de l'article provenant de la source Cambridge
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.
Bluskov, I.; Greig, M.; Heinrich, K. Infinite Classes of Covering Numbers. Canadian mathematical bulletin, Tome 43 (2000) no. 4, pp. 385-396. doi: 10.4153/CMB-2000-046-9
@article{10_4153_CMB_2000_046_9,
author = {Bluskov, I. and Greig, M. and Heinrich, K.},
title = {Infinite {Classes} of {Covering} {Numbers}},
journal = {Canadian mathematical bulletin},
pages = {385--396},
year = {2000},
volume = {43},
number = {4},
doi = {10.4153/CMB-2000-046-9},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2000-046-9/}
}
TY - JOUR AU - Bluskov, I. AU - Greig, M. AU - Heinrich, K. TI - Infinite Classes of Covering Numbers JO - Canadian mathematical bulletin PY - 2000 SP - 385 EP - 396 VL - 43 IS - 4 UR - http://geodesic.mathdoc.fr/articles/10.4153/CMB-2000-046-9/ DO - 10.4153/CMB-2000-046-9 ID - 10_4153_CMB_2000_046_9 ER -
Cité par Sources :