In graph theory, the Kneser graph K(n, k) (alternatively KGn,k) is the graph whose vertices correspond to the k-element subsets of a set of n elements...

tropical curves. The Petersen graph is the complement of the line graph of K 5 {\displaystyle K_{5}} . It is also the Kneser graph K G 5 , 2 {\displaystyle...

Odd chords are used to define strongly chordal graphs. 5.  An odd graph is a special case of a Kneser graph, having one vertex for each (n − 1)-element subset...

linear graphs. Certain Kneser graphs, and certain strongly regular graphs, are also locally linear. The question of how many edges locally linear graphs can...

{\displaystyle J(n,2)} is the line graph of Kn and the complement of the Kneser graph K ( n , 2 ) . {\displaystyle K(n,2).} J ( n , k ) {\displaystyle J(n...

as the triangular graph, the Johnson graph J(n, 2), or the complement of the Kneser graph KGn,2. Triangular graphs are characterized by their spectra,...

by a pair of vertices and each Petersen graph edge by a pair of crossed edges. It is the bipartite Kneser graph H5,2. Its vertices can be labeled by the...

subgraphs Shift graph, a family of triangle-free graphs with arbitrarily high chromatic number The Kneser graph K G 3 k − 1 , k {\displaystyle KG_{3k-1,k}}...

norm 1 vector then the two even lattices are isomorphic.) The Kneser neighborhood graph in 8n dimensions has a point for each even lattice, and a line...

Approximation in algebraic groups Betke–Kneser theorem Kneser–Tits conjecture Kneser's theorem (combinatorics) Kneser graphs "Einfach zusammenhängende algebraische...