Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications

10/15/2018 ∙ by Marthe Bonamy, et al. ∙ 0

Let G be a graph with chromatic number χ, maximum degree Δ and clique number ω. Reed's conjecture states that χ≤ (1-ε)(Δ + 1) + εω for all ε≤ 1/2. It was shown by King and Reed that, provided Δ is large enough, the conjecture holds for ε≤ 1/130,000. In this article, we show that the same statement holds for ε≤ 1/26, thus making a significant step towards Reed's conjecture. We derive this result from a general technique to bound the chromatic number of a graph where no vertex has many edges in its neighbourhood. Our improvements to this method also lead to improved bounds on the strong chromatic index of general graphs. We prove that χ'_s(G)≤ 1.835 Δ(G)^2 provided Δ(G) is large enough.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.