Kneser graph

noun

Kneser graph

noun

Etymology Named after Martin Kneser, who first investigated them in 1956.

1

Graph theory, Mathematics, Sciences 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.

Entry derived from the Wiktionary, under licence CC BY-SA 4.0 — list of authors.