A bound on the total chromatic number

Abstract

We prove that the total chromatic number of any graph with maximum degree Δ is at most Δ plus an absolute constant. In particular, we show that for Δ sufficiently large, the total chromatic number of such a graph is at most Δ + 1026. The proof is probabilistic.