Extremal -intersecting families for finite sets with -covering number at least
arXiv:2602.14129
Abstract
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.