 Ray-Chaudhuri–Wilson theorem

If a $k$-uniform set family on an $n$-element ground set has at most $s$ possible intersection sizes between distinct members, then its size is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. The proof uses the linear independence of incidence polynomials on the $k$-slice.