Log In Sign Up

Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications

by   Marthe Bonamy, et al.

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.


page 1

page 2

page 3

page 4


An improved procedure for colouring graphs of bounded local density

We develop an improved bound for the chromatic number of graphs of maxim...

Perfect Matchings and Quantum Physics: Progress on Krenn's Conjecture

In 2017, Krenn reported that certain problems related to the perfect mat...

On the quartet distance given partial information

Let T be an arbitrary phylogenetic tree with n leaves. It is well-known ...

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree

A collection of graphs is nearly disjoint if every pair of them intersec...

Determining triangulations and quadrangulations by boundary distances

We show that if a disc triangulation has all internal vertex degrees at ...

Strong chromatic index and Hadwiger number

We investigate the effect of a fixed forbidden clique minor upon the str...

Linear programming bounds for cliques in Paley graphs

The Lovász theta number is a semidefinite programming bound on the cliqu...