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.
CITATION STYLE
Aigner, M., & Ziegler, G. M. (2018). The chromatic number of Kneser graphs. In Proofs from THE BOOK (pp. 301–305). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-57265-8_43
Mendeley helps you to discover research relevant for your work.