Counting packings of list-colorings of graphs

Given a list assignment for a graph, list packing asks for the existence of multiple pairwise disjoint list colorings of the graph.Several papers have recently appeared that study the existence of such a packing of list colorings.Formally, a proper L-packing of size k of a graph G is a set of k pairwise disjoint proper L-colorings of G where L is a list assignment of colors to the vertices of G.In this note, we initiate the study of counting such packings of list colorings of a graph.We define P (G, q, k) as the guaranteed number of proper L-packings of size k of G over all list assignments L that assign q colors to each vertex of G, and we let P (G, q, k) be its classical coloring counterpart.We let P (G, q) = P (G, q, q) so that P (G, q) is the enumerative function for the previously studied list packing number (G).Note that the chromatic polynomial of G, P (G, q), is P (G, q, 1), and the list color function of G, P (G, q), is P (G, q, 1).Inspired by the well-known behavior of the list color function and the chromatic polynomial, we make progress towards the question of whether P (G, q, k) = P (G, q, k) when q is large enough.Our result generalizes the recent theorem of Dong and Zhang (2023), which improved results going back to Donner (1992), about when the list color function equals the chromatic polynomial.Further, we use a polynomial method to generalize bounds on the list packing number, (G), of sparse graphs to exponential lower bounds (in the number of vertices of G) on the corresponding list packing functions, P (G, q).