|Google Scholar:||Look up in Google Scholar|
The minimum number of blocks having maximum size precisely four that are required to cover, exactly times, all pairs of elements from a set of cardinality is denoted by . We present a complete solution to this problem for .
|Item Type:||Journal Article|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics|
|Depositing User:||Mike Grannell|
|Date Deposited:||18 Aug 2010 13:13|
|Last Modified:||02 Dec 2010 21:02|
|Share this page:|