Skip to main content
Log in

A Combinatorial Proof of Kneser’s Conjecture*

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Kneser’s conjecture, first proved by Lovász in 1978, states that the graph with all k-element subsets of {1, 2, . . . , n} as vertices and with edges connecting disjoint sets has chromatic number n−2k+2. We derive this result from Tucker’s combinatorial lemma on labeling the vertices of special triangulations of the octahedral ball. By specializing a proof of Tucker’s lemma, we obtain self-contained purely combinatorial proof of Kneser’s conjecture.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiří Matoušek.

Additional information

* Research supported by Charles University grants No. 158/99 and 159/99 and by ETH Zürich.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Matoušek, J. A Combinatorial Proof of Kneser’s Conjecture*. Combinatorica 24, 163–170 (2004). https://doi.org/10.1007/s00493-004-0011-1

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-004-0011-1

Mathematics Subject Classification (2000):

Navigation