The chromatic polynomial of a graph
,
denoted by
, is equal to the
number of proper
-colorings
of
for
each
.
In 1990, Kostochka and Sidorenko introduced the list color function of graph
, denoted
by
,
which is a list analogue of the chromatic polynomial. The
list color function threshold of
, denoted
by
, is the
smallest
such
that
and
whenever
. It is known that
for every graph
,
is finite, and a recent paper of Kaul et al. suggests that complete
bipartite graphs may be the key to understanding the extremal behavior
of
.
We develop tools for bounding the list color function threshold
of complete bipartite graphs from above. We show that, for any
,
. Interestingly,
our proof makes use of classical results such as Rolle’s theorem and Descartes’ rule of signs.
Keywords
list coloring, chromatic polynomial, list color function,
list color function threshold, enumerative
chromatic-choosability