Strong fractional choice number of series-parallel graphs

Xuer Li, Xuding Zhu

The strong fractional choice number of a graph $G$ is the infimum of those real numbers $r$ such that $G$ is $(\lceil rm\rceil ,m)$-choosable for every positive integer $m$. The s…