A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs

Suppose that G is a graph with maximum degree d(G) such that, for every vertex v in G, the neighbourhood of v contains at most d(G)2/f (f > 1) edges. We show that the list chromatic number of G is at most Kd(G)/log f, for some positive constant K. This result is sharp up to the multiplicative constant K and strengthens previous results by Kim [9], Johansson [7], Alon, Krivelevich and Sudakov [3], and the present author [18]. This also motivates several interesting questions.As an application, we derive several upper bounds for the strong (list) chromatic index of a graph, under various assumptions. These bounds extend earlier results by Faudree, Gyarfas, Schelp and Tuza [6] and Mahdian [13] and determine, up to a constant factor, the strong (list) chromatic index of a random graph. Another application is an extension of a result of Kostochka and Steibitz [10] concerning the structure of list critical graphs.

[1]  N. Alon Restricted colorings of graphs , 1993 .

[2]  Jeff Kahn,et al.  Asymptotically Good List-Colorings , 1996, J. Comb. Theory A.

[3]  Mohammad Mahdian,et al.  The strong chromatic index of C 4 -free graphs , 2000 .

[4]  L. Lovász Combinatorial problems and exercises , 1979 .

[5]  Noga Alon,et al.  Coloring Graphs with Sparse Neighborhoods , 1999, J. Comb. Theory B.

[6]  Mohammad Mahdian,et al.  The strong chromatic index of graphs , 2000 .

[7]  Zsolt Tuza,et al.  Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.

[8]  Alexandr V. Kostochka,et al.  On the Number of Edges in Colour-Critical Graphs and Hypergraphs , 2000, Comb..

[9]  Bruce A. Reed,et al.  A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory B.

[10]  Benny Sudakov,et al.  Random regular graphs of high degree , 2001, Random Struct. Algorithms.

[11]  Jeong Han Kim On Brooks' Theorem for Sparse Graphs , 1995, Comb. Probab. Comput..

[12]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[13]  Béla Bollobás,et al.  Random Graphs , 1985 .