arXiv:2111.06214 Abstract | arXiv Analytics

Published 2021-11-11Version 1

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

Categories: math.CO

Keywords: rosenfeld counting method, johansson-molloy theorem, simplified proof, chromatic number

Related articles: Most relevant | Search more

arXiv:1110.1756 [math.CO] (Published 2011-10-08)

About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3

arXiv:math/0208072 [math.CO] (Published 2002-08-09, updated 2003-11-24)

Topological lower bounds for the chromatic number: A hierarchy

arXiv:1412.6349 [math.CO] (Published 2014-12-19)

The chromatic number of a signed graph

arXiv Analytics