A New Short Proof of Kneser's Conjecture

DOI10.2307/3072460zbMath1023.05014WikidataQ29014059 ScholiaQ29014059MaRDI QIDQ4416417

Joshua Evan Greene

Publication date: 3 August 2003

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3072460

Mathematics Subject Classification ID

05A18: Partitions of sets

Related Items

Sparse Kneser graphs are Hamiltonian, Assouad-Nagata dimension and gap for ordered metric spaces, On the number of star‐shaped classes in optimal colorings of Kneser graphs, On random subgraphs of Kneser and Schrijver graphs, A combinatorial proof for the circular chromatic number of Kneser graphs, On \(q\)-analogues and stability theorems, Probabilistic extensions of the Erdős-Ko-Rado property, New construction of graphs with high chromatic number and small clique number, Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\), The toughness of Kneser graphs, 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, On the chromatic number of generalized Kneser hypergraphs, Decomposition of the Kneser graph into paths of length four, On the bandwidth of the Kneser graph, Colorful subgraphs in Kneser-like graphs, Intersection patterns of finite sets and of convex sets