Kneser graph
Summary
In graph theory, the Kneser graph (alternatively ) is the graph whose vertices correspond to the -element subsets of a set of elements, and where two vertices are adjacent if and only if the two corresponding sets are disjoint. Kneser graphs are named after Martin Kneser, who first investigated them in 1956.
Further reading
- Wikipedia, page 2724154, revision 1362915729, Kneser graph. adopted
About this page
| Tag | DXHTCMW7E4 |
|---|---|
| URI | m2://DXHTCMW7E4 |
| Aliases | bipartite-kneser-graph, generalized-kneser-graph, kneser-conjecture, kneser-graphs, knesers-conjecture |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.