A short proof of Kneser's conjecture
From MaRDI portal
Publication:1256485
DOI10.1016/0097-3165(78)90023-7zbMath0404.05028OpenAlexW2164679805WikidataQ123013008 ScholiaQ123013008MaRDI QIDQ1256485
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(78)90023-7
Related Items
On random subgraphs of Kneser and Schrijver graphs, The chromatic profile of locally colourable graphs, On \(r\)-dynamic coloring of graphs, The order dimension of two levels of the Boolean lattices, The neighborhood complexes of almost \(s\)-stable Kneser graphs, A combinatorial proof for the circular chromatic number of Kneser graphs, On the chromatic number of some geometric type Kneser graphs, Choice number of Kneser graphs, Tiling Hamming space with few spheres, Maximum bipartite subgraphs of Kneser graphs, Graph \(r\)-hued colorings -- a survey, A combinatorial proof of the Borsuk-Ulam antipodal point theorem, A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\), Chromatic number of random Kneser hypergraphs, On the connectivity of the disjointness graph of segments of point sets in general position in the plane, On \(q\)-analogues and stability theorems, Fixed-Parameter Algorithms for the Kneser and Schrijver Problems, Unnamed Item, On the chromatic number of Kneser hypergraphs, Graphs of large chromatic number, New construction of graphs with high chromatic number and small clique number, The equivariant topology of stable Kneser graphs, Circular chromatic number of induced subgraphs of Kneser graphs, Intersection patterns of finite sets and of convex sets, On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges, A note on induced cycles in Kneser graphs, Paths of homomorphisms from stable Kneser graphs, Random Kneser graphs and hypergraphs, Topological Bounds for Graph Representations over Any Field, Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\), Helly property in finite set systems, On a problem in combinatorial geometry, The Chromatic Number of Kneser Hypergraphs, A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\), Local chromatic number and distinguishing the strength of topological obstructions, Exact distance graphs of product graphs, The toughness of Kneser graphs, Generalized fractional and circular total colorings of graphs, Borsuk's theorem through complementary pivoting, A generalized Kneser conjecture, Matchings with few colors in colored complete graphs and hypergraphs, Computing a small agreeable set of indivisible items, Topological bounds on the dimension of orthogonal representations of graphs, Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini, On graphs with strongly independent color-classes, Nearly bipartite graphs with large chromatic number, The multichromatic numbers of some Kneser graphs, Sparse Kneser graphs are Hamiltonian, Extremal problems concerning Kneser-graphs, Decomposition of the Kneser graph into paths of length four, Covering radius and the chromatic number of Kneser graphs, On the bandwidth of the Kneser graph
Cites Work
