Kneser graph
= Kneser graph
{c}
{title2=$KG(n,k)$}
{wiki}
The Kneser graph has as <vertices> the $k$-element subsets of $[n]$, with an <edge> between two exactly when they are disjoint. A <graph colouring> of this <graph> partitions the $k$-sets into <intersecting families>.