A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method
arXiv:2111.06214
Abstract
We show that any triangle-free graph with maximum degree has chromatic number at most
arXiv:2111.06214
We show that any triangle-free graph with maximum degree has chromatic number at most