The story
Named after Martin Kneser, who first investigated them in 1956.
Etymology from Wiktionary, CC BY-SA 4.0.
Kneser graph
Today it means: 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. Full definition →