Kneser graphs

A form of Kneser graph — 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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

noun
  1. pluralplural of Kneser graph
Cite this entry
APA

Kneser graphs. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Kneser%20graphs

MLA

“Kneser graphs.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Kneser%20graphs. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Kneser graphs,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Kneser%20graphs.

Source: Kneser graphs on Wiktionary, CC BY-SA 4.0.