A $4$-choosable graph that is not $(8:2)$-choosable

In 1980, Erd\H{o}s, Rubin and Taylor asked whether for all positive integers $a$ , $b$ , and $m$ , every $(a : b)$ -choosable graph is also $(a m : b m)$ -choosable. We provide a negative answer by exhibiting a $4$ -choosable graph that is not $(8 : 2)$ -choosable.

A $4$ -choosable graph that is not $(8 : 2)$ -choosable

文献摘要

讨论

讲解博客

AI智能校验

A $4$ -choosable graph that is not $(8 : 2)$ -choosable

文献摘要

讨论

讲解博客

AI智能校验

A 44-choosable graph that is not (8:2)(8:2)-choosable

文献摘要

讨论

|讲解博客

|AI智能校验

A 44-choosable graph that is not (8:2)(8:2)-choosable

文献摘要

讨论

|讲解博客

|AI智能校验

A $4$ -choosable graph that is not $(8 : 2)$ -choosable

讲解博客

AI智能校验

A $4$ -choosable graph that is not $(8 : 2)$ -choosable

讲解博客

AI智能校验