A New Short Proof of Kneser's Conjecture

DOI10.2307/3072460zbMath1023.05014OpenAlexW4253889688WikidataQ29014059 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

Partitions of sets (05A18)

Related Items (18)

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

This page was built for publication: A New Short Proof of Kneser's Conjecture