Abstract
In 1955 the number theorist Martin Kneser posed a seemingly innocuous problem that became one of the great challenges in graph theory until a brilliant and totally unexpected solution, using the “Borsuk–Ulam theorem” from topology, was found by László Lovász twenty-three years later.
It happens often in mathematics that once a proof for a long-standing problem is found, a shorter one quickly follows, and so it was in this case. Within weeks Imre Bárány showed how to combine the Borsuk–Ulam theorem with another known result to elegantly settle Kneser’s conjecture. Then in 2002 Joshua Greene, an undergraduate student, simplified Bárány’s argument even further, and it is his version of the proof that we present here.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2014). The chromatic number of Kneser graphs. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44205-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-662-44205-0_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44204-3
Online ISBN: 978-3-662-44205-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)