A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method
Combinatorics
2021-11-12 v1
Abstract
We show that any triangle-free graph with maximum degree has chromatic number at most
Keywords
Cite
@article{arxiv.2111.06214,
title = {A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method},
author = {Anders Martinsson},
journal= {arXiv preprint arXiv:2111.06214},
year = {2021}
}