English

Choice number of Kneser graphs

Combinatorics 2022-04-19 v2 Discrete Mathematics

Abstract

In this short note, we show that for any ϵ>0\epsilon >0 and k<n0.5ϵk<n^{0.5-\epsilon} the choice number of the Kneser graph KGn,kKG_{n,k} is Θ(nlogn)\Theta (n\log n).

Keywords

Cite

@article{arxiv.2108.00502,
  title  = {Choice number of Kneser graphs},
  author = {Vera Bulankina and Andrey Kupavskii},
  journal= {arXiv preprint arXiv:2108.00502},
  year   = {2022}
}