Multiple list colouring of planar graphs

This paper proves that for each positive integer $m$, there is a planar graph $G$ which is not $(4m+\lfloor \frac{2m-1}{9}\rfloor ,m)$-choosable. Then we pose some conjectures concerning multiple list colouring of planar graphs.