Choice number of Kneser graphs

Vera Bulankina, Andrey Kupavskii

In this short note, we show that for any $\epsilon >0$ and $k<n^{0.5-\epsilon }$ the choice number of the Kneser graph $K{G}_{n,k}$ is $\Theta (n\log n)$.