The Open UniversitySkip to content

On the small covering numbers $g^{(5)}_1(v)$

Forbes, Anthony; Grannell, Mike; Griggs, Terry and Stanton, R. G. (2007). On the small covering numbers $g^{(5)}_1(v)$. Utilitas Mathematica, 74, pp. 77–96.

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 $v$ is denoted by $g^{(5)}_1(v)$. As a prelude to further work, we give the values of $g^{(5)}_1(v)$ for $v\le 25$, and construct all designs which attain this bound.

Item Type: Journal Article
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Item ID: 22761
Depositing User: Mike Grannell
Date Deposited: 18 Aug 2010 12:43
Last Modified: 15 Jan 2016 14:49
Share this page:

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340