A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method

We show that any triangle-free graph with maximum degree $\mathrm{\Delta }$ has chromatic number at most $(1+o(1))\mathrm{\Delta }\mathrm{/}\log \mathrm{\Delta }\mathrm{.}$