The Kneser graphs $KG_{n,k}$ is the graph whose vertices correspond to the elements of $\binom{n}{k}$, and where two vertices are adjacent if and only if the two corresponding sets are disjoint.
The Kneser graphs $KG_{n,k}$ is the graph whose vertices correspond to the elements of $\binom{n}{k}$, and where two vertices are adjacent if and only if the two corresponding sets are disjoint.