On $\lambda$ -fold coverings with maximum block size four for $\lambda\ge 6$

Grannell, M. J.; Griggs, T. S. and Stanton, RG (2004). On $\lambda$ -fold coverings with maximum block size four for $\lambda\ge 6$ . Utilitas Mathematica, 66, pp. 221–230.

Google Scholar:	Look up in Google Scholar

Abstract

The minimum number of blocks having maximum size precisely four that are required to cover, exactly $\lambda$ times, all pairs of elements from a set of cardinality $v$ is denoted by $g_{\lambda}^{(4)}(v)$ . We present a complete solution to this problem for $\lambda\ge 6$ .

Item Type:	Article
ISSN:	0315-3681
Academic Unit/School:	Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID:	22774
Depositing User:	Mike Grannell
Date Deposited:	18 Aug 2010 13:13
Last Modified:	04 Oct 2016 10:42
URI:	http://oro.open.ac.uk/id/eprint/22774
Share this page:

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

On -fold coverings with maximum block size four for

Abstract

▼ Automated document suggestions from open access sources

Actions (login may be required)

On $\lambda$ -fold coverings with maximum block size four for $\lambda\ge 6$