Non-persistence of equality between chromatic polynomials and list-color functions

Abstract

For any graph $G$, let $P(G,k)$ and $P_{\ell }(G,k)$ denote the chromatic polynomial and the list-color function of $G$, respectively. It remains an open problem whether, for every graph $G$ and integer $k$, the equality $P(G,k)=P_{\ell }(G,k)>0$ implies that $P(G,k+1)=P_{\ell }(G,k+1)$ also holds. In this paper, we answer this question in the negative. For every integer $k\ge 3$, we construct an infinite family of graphs $G$ such that $P(G,k)=P_{\ell }(G,k)>0$ while $P(G,k+1)>P_{\ell }(G,k+1)$. Moreover, using this infinite family of graphs as attachment gadgets, we further show that any graph $H$ with $P(H,k)=P_{\ell }(H,k)>0$ can be developed into an infinite family of graphs $H^{\prime }$ with $P(H^{\prime },k)=P_{\ell }(H^{\prime },k)>0$ and $P(H^{\prime },k+1)>P_{\ell }(H^{\prime },k+1)$.