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+⌊2m−19⌋,m)-choosable. Then we pose some conjectures concerning multiple list colouring of planar graphs.