The list chromatic number of graphs with small clique number

Michael Molloy

We prove that every triangle-free graph with maximum degree $\Delta$ has list chromatic number at most $(1+o(1))\frac{\Delta }{\ln \Delta }$. This matches the best-known bound for graphs of girth at…