On the asymptotic of lottery numbers
Combinatorics
2023-11-14 v1
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\'an numbers. In both cases, there exists a limit of as . We prove the existence of this limit in the general case.
Keywords
Cite
@article{arxiv.2311.07406,
title = {On the asymptotic of lottery numbers},
author = {Alexander Sidorenko},
journal= {arXiv preprint arXiv:2311.07406},
year = {2023}
}