On total colourings of graphs (Q2277476)

We show that as \(n\to \infty\) the proportion of graphs on vertices 1,2,...,n with total chromatic number \(\chi ''>\Delta +1\) is very small; and the proportion with \(\chi ''>\Delta +2\) is very very small. Here \(\Delta\) denotes the maximum vertex degree. We also give an easy new deterministic upper bound on \(\chi ''\) (proved randomly).