From Wiktionary, the free dictionary
Named after Martin Kneser, who first investigated them in 1956.
Kneser graph (plural Kneser graphs)
- (graph theory) A graph K(n, k) (alternatively KGn,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.
