Intersection families and Snevily's conjecture (Q872042)

Let \(K=\{k_{1},\dots ,k_{r}\}\), \(L=\{l_{1},\dots,l_{s}\}\) be sets of natural numbers. There are many conjectures and results on the following problem: What is the maximum size of a family \(\mathcal{F}\) \(=\{F_{i}\mid i\in I\}\) of subsets of \(\{1,\dots,n\},\) such that \(| F_{i}| \in K,\) and \(| F_{i}\cap F_{j}| \in L\) for all \(i\neq j\), \(i,j\in I.\) In this paper an upper bound on \(| \mathcal{F}| \) is given in the case when \(K\) comprises consecutive numbers and \(| F_{i}| \notin L.\)