English

The Exact Erd\H{o}s-Ko-Rado Theorem for 3-wise $t$-intersecting uniform families

Combinatorics 2026-03-10 v1

Abstract

Let F\mathcal{F} be a family of kk-element subsets of {1,2,,n}\{1,2,\ldots,n\}. For t1t\geq 1, we say that F\mathcal{F} is {\it 3-wise tt-intersecting} if F1F2F3t|F_1\cap F_2\cap F_3|\geq t for all F1,F2,F3FF_1,F_2,F_3\in \mathcal{F}. In the present paper, we prove that if F\mathcal{F} is 3-wise tt-intersecting and n4t+912kn\geq \frac{\sqrt{4t+9}-1}{2}k, k>t46k>t\geq 46, then F(ntkt)|\mathcal{F}|\leq \binom{n-t}{k-t}. The restriction on nn is asymptotically best possible. The corresponding result for non-trivial 3-wise tt-intersecting families is obtained as well for n4t+912kn\geq \frac{\sqrt{4t+9}-1}{2}k and k>t55k>t\geq 55.

Keywords

Cite

@article{arxiv.2603.07991,
  title  = {The Exact Erd\H{o}s-Ko-Rado Theorem for 3-wise $t$-intersecting uniform families},
  author = {Peter Frankl and Jian Wang},
  journal= {arXiv preprint arXiv:2603.07991},
  year   = {2026}
}