A 4-choosable graph that is not (8:2)-choosable
Abstract
In 1980, Erdos, Rubin and Taylor asked whether for all positive integers a, b, and m, every (a:b)-choosable graph is also (am:bm)-choosable. We provide a negative answer by exhibiting a 4-choosable graph that is not (8:2)-choosable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.