Asymptotics of the total chromatic number for multigraphs

For loopless multigraphs, the total chromatic number is asymptotically its fractional counterpart as the latter invariant tends to infinity. The proof of this is based on a recent theorem of Kahn establishing the analogous asymptotic behaviour of the list-chromatic index for multigraphs.