Erdős-Ko-Rado theorem
= Erdős-Ko-Rado theorem
{c}
{wiki=Erdős–Ko–Rado_theorem}
If $n\geq2k$ and $\mathcal A\subseteq[n]^{(k)}$ is intersecting, then $|\mathcal A|\leq\binom{n-1}{k-1}$.
= Erdős-Ko-Rado theorem
{c}
{wiki=Erdős–Ko–Rado_theorem}
If $n\geq2k$ and $\mathcal A\subseteq[n]^{(k)}$ is intersecting, then $|\mathcal A|\leq\binom{n-1}{k-1}$.