The $(3,1)$-choosability conjecture for planar graphs

A graph is $(3,1)$-choosable if every list assignment in which each list has size at least $3$ and the lists of adjacent vertices have intersection of size at most $1$ admits a proper list colouring. The $(3,1)$-choosability conjecture. Every planar graph is $(3,1)$-choosable. This conjecture concerns list colouring of planar graphs with bounded separation and remains open; it is presented as a conjecture from the literature.