A new intersection theorem and its applications to bounding the chromatic numbers of spaces

In 1981 P. Frankl and R.M. Wilson showed that if H=(V,E) is a k-uniform hypergraph on n vertices and for any F1,F2∈E one has |F1∩F2|≠l with q=k−l being a prime power, then for 2l