On the lottery problem
Article first published online: 7 DEC 1998
Copyright © 1996 John Wiley & Sons, Inc.
Journal of Combinatorial Designs
Volume 4, Issue 1, pages 5–10, 1996
How to Cite
Füredi, Z., Székely, G. J. and Zubor, Z. (1996), On the lottery problem. J. Combin. Designs, 4: 5–10. doi: 10.1002/(SICI)1520-6610(1996)4:1<5::AID-JCD2>3.0.CO;2-J
- Issue published online: 7 DEC 1998
- Article first published online: 7 DEC 1998
- Manuscript Accepted: 2 MAY 1995
- Manuscript Received: 17 FEB 1995
- Hungarian Science Foundation. Grant Number: T016237
Let L(n,k,k,t) denote the minimum number of k-subsets of an n-set such that all the (nk) k-sets are intersected by one of them in at least t elements. In this article L(n,k,k,2) is calculated for infinite sets of n's. We obtain L(90,5,5,2) = 100, i.e., 100 tickets needed to guarantee 2 correct matches in the Hungarian Lottery. The main tool of proofs is a version of Turán's theorem due to Erdös. © 1996 John Wiley & Sons, Inc.