We show that any proper coloring of a Kneser graph $KG_{n,k}$ with $n-2k+2$ colors contains a trivial color (i.e., a color consisting of sets that all contain a fixed element), provided $n>(2+epsilon)k^2$, where $epsilonto 0$ as $kto infty$. This bound is essentially tight.
تحميل البحث