加载中…
In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of -element subsets of the set $[n] = {1,\ldots,n}{n-1\choose k-1}$. We say that two non-empty families are $\mathcal A, \mathcal B\subset {[n]\choose k}are {\its-cross-intersecting}, if for anyA\in\mathcal A,B\in \mathcal B|A\cap B|\ge s$. In this paper we determine the maximum of for all . This generalizes a result of Hilton and Milner, who determined the maximum of for nonempty -cross-intersecting families.

生成讲解博客的中文版本

生成AI智能校验的中文版本