I. Siutkin

Covering Families for DP-Coloring of Cartesian Products with Complete Bipartite Graphs

A famous folklore result in list coloring demonstrating that the gap between the list chromatic number and chromatic number of a graph can be arbitrarily large is: $\chi_{\ell}(K_{l,t}) = 1+l$ if and only if $t \geq l^l$. DP-coloring (also called correspondence coloring) is a well-studied generalization of list colorin...