A $4$-choosable graph that is not $(8:2)$-choosable
Combinatorics
2019-10-28 v2
Abstract
In 1980, Erd\H{o}s, Rubin and Taylor asked whether for all positive integers , , and , every -choosable graph is also -choosable. We provide a negative answer by exhibiting a -choosable graph that is not -choosable.
Cite
@article{arxiv.1806.03880,
title = {A $4$-choosable graph that is not $(8:2)$-choosable},
author = {Zdeněk Dvořák and Xiaolan Hu and Jean-Sébastien Sereni},
journal= {arXiv preprint arXiv:1806.03880},
year = {2019}
}