Bounding the List Color Function Threshold from Above

Hemanshu Kaul, Akash Kumar, Andrew Liu +5

The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colorings of $G$ for each $m\in \mathbb{N}$. In 1990, Kostochka and Sidorenko intro…