paper

On the asymptotic of lottery numbers

arXiv:2311.07406

Abstract

Let denote the minimum number of -subsets of an -set such that all the -subsets are intersected by one of them in at least elements. The case corresponds to the covering numbers, while the case corresponds to the Turán numbers. In both cases, there exists a limit of as . We prove the existence of this limit in the general case.