New lower bounds for t-coverings

作者:Horsley Daniel; Singh Rakhi*
来源:Journal of Combinatorial Designs, 2018, 26(8): 369-386.
DOI:10.1002/jcd.21591

摘要

Fisher proved in 1940 that any 2-design with.. >.. has at least.. blocks. In 1975, Ray-Chaudhuri and Wilson generalized this result by showing that every.. -design with..... +... / 2. has at least.. (... / 2.) blocks. By combining methods used by Bose and Wilson in proofs of these results, we obtain new lower bounds on the size of.. coverings. Our results generalize lower bounds on the size of 2-coverings recently obtained by the first author.

  • 出版日期2018-8