On the number of blocks in a perfect cov
โ
Rolf Rees; D.R. Stinson
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 710 KB
In this paper, we study bounds on gck'(v), which denotes the minimum number of blocks to cover every pair of a v-set exactly once, when the largest block has size k. This bound is exact when v < 2k, but becomes progressively weaker as u increases (for any fixed value of k). A much more powerful bou