Asymptotically optimal frugal colouring

作者：Molloy Michael^*; Reed Bruce

来源：Journal of Combinatorial Theory - Series B, 2010, 100(2): 226-246.

DOI：10.1016/j.jctb.2009.07.002

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

• 出版日期2010-3