Kneser graph

noun1

1. •
   A graph K(n, k) (alternatively KG_(n,k)), whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are adjacent iff the two corresponding sets are disjoint.