The Open UniversitySkip to content
 

On exact bicoverings of 12 points

Allston, J. L.; Grannell, M. J.; Griggs, T. S.; Quinn, K. A. S. and Stanton, R. G. (2000). On exact bicoverings of 12 points. Ars Combinatoria, 55, pp. 147–159.

URL: http://www.combinatorialmath.ca/ArsCombinatoria/in...
Google Scholar: Look up in Google Scholar

Abstract

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,\ldots,11$. It was previously known that $13\le g(2,2;12)\le 16$. We prove that $g(2,2;12)\ge 14$.

Item Type: Journal Article
ISSN: 0381-7032
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Item ID: 22796
Depositing User: Mike Grannell
Date Deposited: 18 Aug 2010 13:48
Last Modified: 02 Dec 2010 21:02
URI: http://oro.open.ac.uk/id/eprint/22796
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk