Extracting list colorings from large independent sets

Abstract

We take an application of the Kernel Lemma by Kostochka and Yancey to its logical conclusion. The consequence is a sort of magical way to draw conclusions about list coloring (and online list coloring) just from the existence of an independent set incident to many edges. We use this to prove an Ore-degree version of Brooks' Theorem for online list-coloring. The Ore-degree of an edge $xy$ in a graph $G$ is $θ(xy) = d_G(x) + d_G(y)$. The Ore-degree of $G$ is $θ(G) = \max_{xy\in E(G)}θ(xy)$. We show that every graph with $θ\ge18$ and $ω\le\fracθ{2}$ is online $\left\lfloor \fracθ{2}\right\rfloor $-choosable. In addition, we prove an upper bound for online list-coloring triangle-free graphs: $χ_{OL}\leΔ+1-\lfloor\frac{1}{4}\lg(Δ)\rfloor$. Finally, we characterize Gallai trees as the connected graphs $G$ with no independent set incident to at least $|G|$ edges.