1 problem

For a graph $G$, let $\chi_{\ell}(G)$ denote its list-chromatic number and let $\chi_{\ell}^*(G)$ denote its list packing number, the least $k$ such that every $k$-assignment admit…