加载中…
Let be a -intersecting family. Define the -covering number of as the minimum size of a subset of with for each . In this paper, we characterize for which takes the maximum value under the condition that and is sufficiently large, thereby generalizing two results by Frankl.

生成讲解博客的中文版本

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