Sharp threshold for the Erdős-Ko-Rado theorem

József Balogh, Robert A. Krueger, Haoran Luo

For positive integers $n$ and $k$ with $n\ge 2k+1$, the Kneser graph $K(n,k)$ is the graph with vertex set consisting of all $k$-sets of $\{1,\dots ,n\}$, where two $k$-sets are ad…