A sharp bound for the number of sets that pairwise intersect at \(k\) positive values (Q1878792)

The author proves a generalization of an old theorem by \textit{K. N. Majumdar} [Ann. Math. Stat. 24, 377--389 (1953; Zbl 0051.10802)]. In fact, this paper closes a long process of improvements involving also \textit{P. Frankl} and \textit{Z. Füredi} [Families of finite sets with missing intersections, Finite and infinite sets, 6th Hung. Combin. Colloq., Eger/Hung. 1981, Coll. Math. Soc. János Bolyai 37, 305--318 (1984; Zbl 0575.05001)] and \textit{L. Pyber} [Discrete Math. 52, 253--268 (1984; Zbl 0557.05004)]. If \(\mathcal {L}\) is a set of \(k\) positive integers and \(\{A_1, \dots, A_m \}\) is a family of subsets of an \(n\)-element set such that \(| A_i \cap A_j| \in {\mathcal L}\) for all \(i \not = j\), then \(m \leq \sum_{i=0}^k {n-1 \choose i}\).