Kneser graph

English

Etymology

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

Noun

Kneser graph (plural Kneser graphs)

  1. (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.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.