Coloring Bipartite Graphs with Semi-small List Size

Abstract

Abstract Recently, Alon, Cambie, and Kang introduced asymmetric list coloring of bipartite graphs, where the size of each vertex’s list depends on its part. For complete bipartite graphs, we fix the list sizes of one part and consider the resulting asymptotics, revealing an invariant quantity instrumental in determining choosability across most of the parameter space. By connecting this quantity to a simple question on independent sets of hypergraphs, we strengthen bounds when a part has list size 2. Finally, we state via our framework a conjecture on general bipartite graphs, unifying three conjectures of Alon–Cambie–Kang.