Skip to main content
MathOverflow

Return to Answer

http -> https (the question was bumped anyway)
Source Link
Martin Sleziak
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

The chromatic number of the Kneser graphKneser graph $KG_{n,k}$ is equal exactly $2n-k+2$. There are very simple proof based on Borsuk-Ulam theorem.

The chromatic number of the Kneser graph $KG_{n,k}$ is equal exactly $2n-k+2$. There are very simple proof based on Borsuk-Ulam theorem.

The chromatic number of the Kneser graph $KG_{n,k}$ is equal exactly $2n-k+2$. There are very simple proof based on Borsuk-Ulam theorem.

Post Made Community Wiki
Source Link
Arseniy Akopyan
Arseniy Akopyan
  • 1.4k
  • 10
  • 20

The chromatic number of the Kneser graph $KG_{n,k}$ is equal exactly $2n-k+2$. There are very simple proof based on Borsuk-Ulam theorem.