On $\lambda$ -fold coverings with maximum block size four for $\lambda = 3, 4$ and 5

Grannell, Mike; Griggs, Terry and Stanton, R. G. (2004). On $\lambda$ -fold coverings with maximum block size four for $\lambda = 3, 4$ and 5. Journal of Combinatorial Mathematics and Combinatorial Computing, 51, pp. 137–158.

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=3,4$ and 5.

Item Type:	Journal Article
ISSN:	0835-3026
Academic Unit/Department:	Mathematics, Computing and Technology > Mathematics and Statistics
Item ID:	22773
Depositing User:	Mike Grannell
Date Deposited:	18 Aug 2010 13:09
Last Modified:	02 Dec 2010 21:02
URI:	http://oro.open.ac.uk/id/eprint/22773

Actions (login may be required)

	View Item
	Public: Report issue / request change

Policies | Disclaimer

On -fold coverings with maximum block size four for and 5

Abstract

Actions (login may be required)

On $\lambda$ -fold coverings with maximum block size four for $\lambda = 3, 4$ and 5