The Intersection Structure of $t$-Intersecting Families
Keyword(s):
A family of sets is $t$-intersecting if any two sets from the family contain at least $t$ common elements. Given a $t$-intersecting family of $r$-sets from an $n$-set, how many distinct sets of size $k$ can occur as pairwise intersections of its members? We prove an asymptotic upper bound on this number that can always be achieved. This result can be seen as a generalization of the Erdős-Ko-Rado theorem.
Keyword(s):
2017 ◽
Vol 27
(1)
◽
pp. 60-68
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 67
(6)
◽
pp. 3852-3864
◽
Keyword(s):
2009 ◽
Vol 18
(1-2)
◽
pp. 107-122
◽