The Open UniversitySkip to content

More on exact bicoverings of 12 points

Grannell, M. J.; Griggs, T. S.; Maenhaut, B. M.; Quinn, K. A. S. and Stanton, R. G. (2003). More on exact bicoverings of 12 points. Ars Combinatoria, 69 pp. 197–213.

Google Scholar: Look up in Google Scholar


The minimum number of incomplete blocks required to cover, exactly $\lambda$ times, all $t$-element subsets from a set $V$ of cardinality $v$ ($v>t$) is denoted by $g(\lambda,t;v)$. The value of $g(2,2;v)$ is known for $v=3,4,\dots,11$. It was previously known that $14\leq g(2,2;12)\leq16$. We prove that $g(2,2;12) \geq 15$.

Item Type: Journal Article
Copyright Holders: 2003 Not known
ISSN: 0381-7032
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Related URLs:
Item ID: 22777
Depositing User: Mike Grannell
Date Deposited: 18 Aug 2010 13:19
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