Uniform eventown problems

作者：Frankl Peter^*; Tokushige Norihide

来源：European Journal of Combinatorics, 2016, 51: 280-286.

DOI：10.1016/j.ejc.2015.06.001

Let n >= k >= l >= 2 be integers, and let F be a family of k-element subsets of an n-element set. Suppose that I divides the size of the intersection of any two (not necessarily distinct) members in F. We prove that the size of F is at most ([n/l] k/l) provided n is sufficiently large for fixed k and l.

• 出版日期2016-1