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.
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
Rights and permissions
Copyright information
© 2018 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2018). The chromatic number of Kneser graphs. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57265-8_43
Download citation
DOI: https://doi.org/10.1007/978-3-662-57265-8_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-57264-1
Online ISBN: 978-3-662-57265-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)