The complete nontrivial-intersection theorem for systems of finite sets
Extending earlier results of \textit{P. Frankl} [On intersecting families of finite sets, J. Comb. Theory, Ser. A 24, 146-161 (1978; Zbl 0384.05002)] the maximum cardinality of \(k\)-element subsets of an \(n\)-element set with pairwise intersection of size at least \(t\) is determined if it is nontrivial, i.e., the intersection of all sets has less than \(t\) elements.
scientific article; zbMATH DE number 934995