We prove that every graph with maximum degree ∆ can be properly (∆ + 1)coloured so that no colour appears more than O(log ∆/ log log ∆) times in the neighbourhood of any vertex. This is best possible up to the constant multiple in the O(−) term.
Michael Molloy, Bruce A. Reed