Coloring graphs with forbidden bipartite subgraphs

07/12/2021
by   James Anderson, et al.
0

A conjecture of Alon, Krivelevich, and Sudakov states that, for any graph F, there is a constant c_F > 0 such that if G is an F-free graph of maximum degree Δ, then χ(G) ≤ c_F Δ / logΔ. Alon, Krivelevich, and Sudakov verified this conjecture for a class of graphs F that includes all bipartite graphs. Moreover, it follows from recent work by Davies, Kang, Pirot, and Sereni that if G is K_t,t-free, then χ(G) ≤ (t + o(1)) Δ / logΔ as Δ→∞. We improve this bound to (1+o(1)) Δ/logΔ, making the constant factor independent of t. We further extend our result to the DP-coloring setting (also known as correspondence coloring), introduced by Dvořák and Postle.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2020

Total Coloring for some classes of Circulant graphs

The Total coloring conjecture states that any simple graph G with maximu...
research
06/13/2020

Total Coloring for some classes of Cayley graphs

The Total coloring conjecture states that any simple graph G with maximu...
research
02/24/2023

Vizing's edge-recoloring conjecture holds

In 1964 Vizing proved that starting from any k-edge-coloring of a graph ...
research
07/12/2020

The linear arboricity conjecture for 3-degenerate graphs

A k-linear coloring of a graph G is an edge coloring of G with k colors ...
research
09/23/2021

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...
research
07/16/2023

Weighted Graph Coloring for Quantized Computing

We consider the problem of distributed lossless computation of a functio...
research
01/23/2021

Point-hyperplane incidence geometry and the log-rank conjecture

We study the log-rank conjecture from the perspective of incidence geome...

Please sign up or login with your details

Forgot password? Click here to reset