For m non-empty pairwise cross t-intersecting families, the sum of their sizes is at most max{sum_{k=t to n} binom(n,k) + m-1, m M(n,t)}, with a complete characterization of the extremal families.
Wilson, The exact bound in the Erd˝ os–Ko–Rado theorem, Combinatorica 4 (1984) 247– 257
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Non-uniform pairwise cross $t$-intersecting families
For m non-empty pairwise cross t-intersecting families, the sum of their sizes is at most max{sum_{k=t to n} binom(n,k) + m-1, m M(n,t)}, with a complete characterization of the extremal families.