📝 SummarXiv

Abstract

Chromatic-choosablility is a notion of fundamental importance in list coloring. A graph $G$ is chromatic-choosable when its chromatic number, $\chi(G)$, is equal to its list chromatic number $\chi_{\ell}(G)$. Flexible list coloring was introduced by Dvo\v{r}\'{a}k, Norin, and Postle in 2019 in order to address a situation in list coloring where we still seek a proper list coloring, but each vertex may have a preferred color assigned to it, and for those vertices we wish to color as many of them with their preferred colors as possible. In flexible list coloring, the list flexibility number of $G$, denoted $\chi_{\ell flex}(G)$, serves as the natural analogue of $\chi_{\ell}(G)$. In 2002, Ohba famously showed that for any graph $G$, there exists an $N \in \mathbb{N}$ such that $\chi(K_p \vee G) = \chi_{\ell}(K_p \vee G)$ whenever $p \geq N$. Since $\chi(G) \leq \chi_{\ell}(G) \leq \chi_{\ell flex}(G)$, it is natural to ask whether this result holds if $\chi_{\ell}$ is replaced with $\chi_{\ell flex}$. In this paper we not only show that this result doesn't hold in general if $\chi_{\ell}$ is replaced with $\chi_{\ell flex}$, but we also give a characterization of the graphs for which it does hold.