Trivial colors in colorings of Kneser graphs

We show that any proper coloring of a Kneser graph $K{G}_{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 $\epsilon \to 0$ as $k\to \mathrm{\infty }$. This bound is essentially tight. This is a consequence of a more general result on the minimum number of non-trivial colors needed to properly color $K{G}_{n,k}$.