Lotto Designs (1998)
by
J. A. Bate
,
G. H. J. Van Rees
| Venue: | JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING |
| Citations: | 1 - 1 self |
BibTeX
@ARTICLE{Bate98lottodesigns,
author = {J. A. Bate and G. H. J. Van Rees},
title = {Lotto Designs},
journal = {JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING},
year = {1998},
volume = {28},
pages = {15--39}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Let L(n,k,p,t) be the minimum number of subsets of size k (k-subsets) of a set of size n (n-set) such that any p-subset intersects at least one of these k-subsets in at least t elements. The value of L(n,6,6,2) is determined for n 54.
Citations
| 929 | Modern Graph Theory - Bollobas - 1998 |
| 40 | A theorem on coloring the lines of a network - Shannon - 1949 |
| 31 | On coverings - Schönheim - 1964 |
| 9 | Tur'an-type problems - Furedi - 1991 |
| 6 | A Generalized Covering Problem - Bate - 1978 |
| 4 | Extremal Problems in Graph Theory - Hartman - 1997 |
| 1 | Winning the Lottery - Colbourn - 1996 |
| 1 | New Constructions for Coverings - Gordon, Patashnik - 1995 |
| 1 | The distribution of spaces on Lottery tickets, Fibonacci Quarterly 33 - Henz - 1995 |
| 1 | Coverings and Packings, in Contempory Design Theory A collection of Surveys - Mullin - 1992 |
| 1 | Jolla Covering Repository, (Internet site) URL is http://sdcc12.ucsd.edu/~xm3dg/cover.html - Gordon, La - 1998 |
