List Coloring and $n$-monophilic graphs

Radoslav Kirov, Ramin Naimi

In 1990, Kostochka and Sidorenko proposed studying the smallest number of list-colorings of a graph $G$ among all assignments of lists of a given size $n$ to its vertices. We say a…