1 problem

Let $\Delta$ be a maximum-degree bound, let $q\ge 2\Delta$, and consider graphs of maximum degree at most $\Delta$. A $q$-list packing assigns colors from each vertex's list so tha…