Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424065 | European Journal of Combinatorics | 2016 | 7 Pages |
Abstract
Let nâ¥kâ¥lâ¥2 be integers, and let F be a family of k-element subsets of an n-element set. Suppose that l 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Frankl, Norihide Tokushige,