Colouring locally sparse graphs with the first moment method

François Pirot, Eoin Hurley

We give a short proof of a bound on the list chromatic number of graphs $G$ of maximum degree $\Delta$ where each neighbourhood has density at most $d$, namely $χ_\ell(G) \le (1+o(1)) \…