List colouring of graphs with at most $\big(2-o(1)\big)χ$ vertices
Bruce A. Reed, Benny Sudakov · arXiv (Cornell University) · 2003
Ohba has conjectured \cite{ohb} that if the graph $G$ has $2χ(G)+1$ or fewer vertices then the list chromatic number and chromatic number of $G$ are equal. In this paper we prove that this conjecture is asymptotically correct. More precisely we obtain that for any $0