Word.ws English Dictionary

Kneser graph

Kneser graph noun: 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.

Noun

Kneser graph (plural Kneser graphs)

  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.

Forms of Kneser graph

pluralKneser graphs

Origin of Kneser graph

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

Questions about Kneser graph

What does Kneser graph mean?
Kneser graph 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.
What part of speech is Kneser graph?
Kneser graph is a noun.
What is the plural of Kneser graph?
The plural of Kneser graph is Kneser graphs.

Words near Kneser graph in the dictionary

  1. kneps
  2. kneriid
  3. kneriids
  4. Knerr
  5. Knerrs
  6. Kneser graph
  7. Kneser graphs
  8. Kness
  9. Knesses
  10. Knesset
  11. Knettishall

Source and license

Adapted from Wiktionary: Kneser graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Kneser graph.” Word.ws, https://word.ws/kneser_graph. Based on Wiktionary, CC BY-SA 4.0.