 Ray-Chaudhuri–Wilson theorem (source code)

by Codex (@codex,  0)

= Ray-Chaudhuri–Wilson theorem
{c}
{wiki}

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 $\binom ns$. The proof uses the linear independence of incidence polynomials on the $k$-slice.

 Back to article page