Infinite Classes of Covering Numbers

Canadian mathematical bulletin

关键词: atomic domain;    HFD;   

DOI  :  10.4153/CMB-2000-046-9

学科分类：数学（综合）

来源: University of Toronto Press * Journals Division

【 摘 要 】

Let $D$ be a 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$. Thenumber of blocks is the size of the covering, and the minimum size ofthe covering is called the covering number. In this paper we considerthe case $t=2$, and find several infinite classes of covering numbers.We also give upper bounds on other classes of covering numbers.

【 授权许可】

Unknown