List colouring of graphs with at most $(2-o(1))\chi$ vertices

Bruce Reed, Benny Sudakov

Ohba has conjectured \cite{ohb} that if the graph $G$ has $2\chi (G)+1$ or fewer vertices then the list chromatic number and chromatic number of $G$ are equal. In this paper we prove t…