Kneser's conjecture, chromatic number, and homotopy

Research output: Contribution to journalArticle

400 Citations (Scopus)


If the simplicial complex formed by the neighborhoods of points of a graph is (k - 2)-connected then the graph is not k-colorable. As a corollary Kneser's conjecture is proved, asserting that if all n-subsets of a (2n - k)-element set are divided into k + 1 classes, one of the classes contains two disjoint n-subsets.

Original languageEnglish
Pages (from-to)319-324
Number of pages6
JournalJournal of Combinatorial Theory, Series A
Issue number3
Publication statusPublished - Nov 1978

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Kneser's conjecture, chromatic number, and homotopy'. Together they form a unique fingerprint.

  • Cite this