Intersecting families of sets, no \(l\) containing two common elements (Q1841906)

The author studies the maximum size of a family \({\mathcal F}\) of subsets of \([n]= \{1,\dots, n\}\) such that any \(k\) members of \({\mathcal F}\) have a non-empty intersection but any \(\ell\) distinct members have an empty intersection. He reduces this problem to a special covering problem. Moreover, he shows that if \({\mathcal F}\) has the property that any two members have a non-empty intersection but the intersection of any \(\ell\) distinct members contains no two different elements, then \(|{\mathcal F}|\leq(\ell- 1)n+ o(n)\).