Coloring Graphs with Sparse Neighborhoods

It is shown that the chromatic number of any graph with maximum degree d in which the number of edges in the induced subgraph on the set of all neighbors of any vertex does not exceed d2/f is at most O(d/logf). This is tight (up to a constant factor) for all admissible values of d and f.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[3]  Béla Bollobás.  Chromatic number, girth and maximal degree , 1978, Discret. Math..

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

[5]  János Komlós,et al.  A Dense Infinite Sidon Sequence , 1981, Eur. J. Comb..

[6]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

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

[8]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

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

[10]  Noga Alon,et al.  List Coloring of Random and Pseudo-Random Graphs , 1999, Comb..

[11]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.