The chromatic number of Kneser graphs

  • Martin Aigner
  • Günter M. Ziegler
Chapter

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  • Martin Aigner
    • 1
  • Günter M. Ziegler
    • 1
  1. 1.Institut für MathematikFreie Universität BerlinBerlinGermany

Personalised recommendations