Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02084509n
Noun Concept
Categories: Parametric families of graphs, Regular graphs
EN
Kneser graph  bipartite Kneser graph  Generalized Kneser graph  Kneser's conjecture  Kneser conjecture
EN
In graph theory, the Kneser graph K is the graph whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are adjacent if and only if the two corresponding sets are disjoint. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, the Kneser graph K is the graph whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are adjacent if and only if the two corresponding sets are disjoint. Wikipedia
A graph representing disjointness between k-element subsets of an n-element set Wikidata
IS A
edge-transitive graph
HAS KIND
CA
Graf bipartit de Kneser
NAMED AFTER
Martin Kneser
STUDIED BY
graph theory
Wikipedia
EN
Kneser graph
Wikidata
EN
Kneser graph
Wikipedia Redirections
EN
bipartite Kneser graph, Generalized Kneser graph, Kneser's conjecture, Kneser conjecture, Kneser graphs

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License