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

by   Tom Kelly, et al.

A collection of graphs is nearly disjoint if every pair of them intersects in at most one vertex. We prove that if G_1, …, G_m are nearly disjoint graphs of maximum degree at most D, then the following holds. For every fixed C, if each vertex v ∈⋃_i=1^m V(G_i) is contained in at most C of the graphs G_1, …, G_m, then the (list) chromatic number of ⋃_i=1^m G_i is at most D + o(D). This result confirms a special case of a conjecture of Vu and generalizes Kahn's bound on the list chromatic index of linear uniform hypergraphs of bounded maximum degree. In fact, this result holds for the correspondence (or DP) chromatic number and thus implies a recent result of Molloy, and we derive this result from a more general list coloring result in the setting of `color degrees' that also implies a result of Reed and Sudakov.



There are no comments yet.


page 1

page 2

page 3

page 4


2-distance list (Δ+ 3)-coloring of sparse graphs

A 2-distance list k-coloring of a graph is a proper coloring of the vert...

Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications

Let G be a graph with chromatic number χ, maximum degree Δ and clique nu...

A local epsilon version of Reed's Conjecture

In 1998, Reed conjectured that every graph G satisfies χ(G) ≤1/2(Δ(G) + ...

Coloring graphs with forbidden bipartite subgraphs

A conjecture of Alon, Krivelevich, and Sudakov states that, for any grap...

Flexible List Colorings in Graphs with Special Degeneracy Conditions

For a given ε > 0, we say that a graph G is ϵ-flexibly k-choosable if th...

Complexity of packing common bases in matroids

One of the most intriguing unsolved questions of matroid optimization is...

Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c ≤ 12

We study c-crossing-critical graphs, which are the minimal graphs that r...
This week in AI

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