### Abstract

Let L(n, k, k, t) denote the minimum number of k-subsets of an n-set such that all the (^{n}_{k}) 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 Erdos.

Original language | English |
---|---|

Pages (from-to) | 5-10 |

Number of pages | 6 |

Journal | Journal of Combinatorial Designs |

Volume | 4 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 1 1996 |

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'On the lottery problem'. Together they form a unique fingerprint.

## Cite this

Füredi, Z., Székely, G. J., & Zubor, Z. (1996). On the lottery problem.

*Journal of Combinatorial Designs*,*4*(1), 5-10. https://doi.org/10.1002/(SICI)1520-6610(1996)4:1<5::AID-JCD2>3.0.CO;2-J