Nearly Erdős-Ko-Rado theorems
Abstract
If a family $\mathcal{F}$ of $k$-element subsets of an $n$-element set is pairwise intersecting, $2k\leq n$ then $|\mathcal{F}|\leq {n-1\choose k-1}$ holds by the celebrated Erdős-Ko-Rado theorem. But an intersecting family obviously satisfies the condition $${\ell \choose 2}\leq \sum_{1\leq i
Fields of Study & Subjects
Advanced Combinatorial Mathematics
Limits and Structures in Graph Theory
Analytic Number Theory Research
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 11 January 2026
- Document type
- Preprint