|Google Scholar:||Look up in Google Scholar|
The minimum number of blocks having maximum size precisely five that is required to cover, exactly once, all pairs of elements from a set of cardinality is denoted by . As a prelude to further work, we give the values of for , and construct all designs which attain this bound.
|Item Type:||Journal Article|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics|
|Depositing User:||Mike Grannell|
|Date Deposited:||18 Aug 2010 12:43|
|Last Modified:||21 Dec 2010 10:45|
|Share this page:|