Coloring graphs with forbidden almost bipartite subgraphs

TL;DR

This paper proves a uniform upper bound for the chromatic number of graphs excluding certain almost bipartite subgraphs, advancing understanding of graph coloring in relation to forbidden subgraphs.

Contribution

It establishes a universal constant bound for the chromatic number of F-free graphs with almost bipartite forbidden subgraphs, improving previous bounds that depended on the specific graph.

Findings

Proves c(F) ≤ 4 for all almost bipartite graphs F.

Extends results to DP-coloring framework.

Discusses algorithmic implications of the bounds.

Abstract

Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph $F$, there exists a quantity $c(F)$ such that $\chi(G) \leq (c(F) + o(1)) \Delta / \log\Delta$ whenever $G$ is an $F$-free graph of maximum degree $\Delta$. The largest class of connected graphs $F$ for which this conjecture has been verified so far, by Alon, Krivelevich, and Sudakov themselves, comprises the almost bipartite graphs (i.e., subgraphs of the complete tripartite graph $K_{1,t,t}$ for some $t \in \mathbb{N}$). However, the optimal value for $c(F)$ remains unknown even for such graphs. Bollob\'as showed, using random regular graphs, that $c(F) \geq 1/2$ when $F$ contains a cycle. On the other hand, Davies, Kang, Pirot, and Sereni recently established an upper bound of $c(K_{1,t,t}) \leq t$. We improve this to a uniform constant, showing $c(F) \leq 4$ for every almost bipartite graph $F$. This surprisingly makes the bound independent of $F$ in all the known cases of the conjecture. We also establish a more general version of our bound in the setting of DP-coloring (also known as correspondence coloring) and consider some algorithmic consequences of our results.