Geodesic
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 University Press

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.
DOI : 10.4153/CMB-2000-046-9
Mots-clés : 05B40, 05D05 
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  - 
%0 Journal Article
%A Bluskov, I.
%A Greig, M.
%A Heinrich, K.
%T Infinite Classes of Covering Numbers
%J Canadian mathematical bulletin
%D 2000
%P 385-396
%V 43
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-2000-046-9/
%R 10.4153/CMB-2000-046-9
%F 10_4153_CMB_2000_046_9

[1] [1] Baker, R. D., An elliptic semiplane. J. Combin. Theory Ser. A 25 (1978), 193–195. Google Scholar

[2] [2] Bluskov, I., Some t-Designs are Minimal (t + 1)-Coverings. Discrete Math. 188 (1998), 245–251. Google Scholar

[3] [3] Gordon, D. M., Kuperberg, G. and Patashnik, O., New Constructions for Covering Designs. J. Combin. Des. 3 (1995), 269–284. Google Scholar

[4] [4] Mathon, R., On a new divisible semiplane. Unpublished manuscript. Google Scholar

[5] [5] Mills, W. H. and Mullin, R. C., Coverings and Packings. In: Contemporary Design Theory: A Collection of Surveys (eds. J. H. Dinitz and D. R. Stinson), Wiley, 1992, 371–399. Google Scholar

[6] [6] Schönheim, J., On Coverings. Pacific J. Math. 14 (1964), 1405–1411. Google Scholar

[7] [7] Shrikhande, S. S., A note on mutually orthogonal Latin squares. Shankhyā A 23 (1961), 115–116. Google Scholar

[8] [8] Todorov, D. T., Some coverings derived from finite planes. In: Finite and Infinite Sets, Vol. 2 (eds. A. Hajnal, L. Lovász and V. T. Śos), Colloq. Math. Soc. Janos Bolyai 37, Elsevier, New York, 1984, 697–710. Google Scholar

Cité par Sources :