Grannell, M. J.; Griggs, T. S.; Maenhaut, B. M.; Quinn, K. A. S. and Stanton, R. G.
|Google Scholar:||Look up in Google Scholar|
The minimum number of incomplete blocks required to cover, exactly times, all -element subsets from a set of cardinality () is denoted by . The value of is known for . It was previously known that . We prove that .
|Item Type:||Journal Article|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics|
|Depositing User:||Mike Grannell|
|Date Deposited:||18 Aug 2010 13:19|
|Last Modified:||02 Dec 2010 21:02|
|Share this page:|
Actions (login may be required)
|Report issue / request change|