Kneser graph

English dictionary entry

Meanings

noun
  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.

Word forms

Kneser graph Kneser graphs

Etymology

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

This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.