Strengthening $(a,b)$-Choosability Results to $(a,b)$-Paintability

[摘要] Let $a,b\in\mathbb{N}$. A graph $G$ is $(a,b)$-choosable if for any list assignment $L$ such that $|L(v)|\ge a$, there exists a coloring in which each vertex $v$ receives a set $C(v)$ of $b$ colors such that $C(v)\subseteq L(v)$ and $C(u)\cap C(w)=\emptys

[学科分类] 离散数学和组合数学

[关键词] Graph theory;Graph coloring;Paintability;Online list coloring