Grannell, M. J.; Griggs, T. S.; Maenhaut, B. M.; Quinn, K. A. S. and Stanton, R. G.
(2003).
| 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 times, all
-element subsets from a set
of cardinality
(
) is denoted by
. The value of
is known for
. It was previously known that
. We prove that
.
| Item Type: | Journal Article |
|---|---|
| ISSN: | 0381-7032 |
| Academic Unit/Department: | Mathematics, Computing and Technology > Mathematics and Statistics |
| Item ID: | 22777 |
| Depositing User: | Mike Grannell |
| Date Deposited: | 18 Aug 2010 13:19 |
| Last Modified: | 02 Dec 2010 21:02 |
| URI: | http://oro.open.ac.uk/id/eprint/22777 |
Actions (login may be required)
| View Item | |
| Public: Report issue / request change |




