Colouring graphs from random lists

Dan Hefetz, Michael Krivelevich

Given positive integers $k\le m$ and a graph $G$, a family of lists $L=\{L(v):v\in V(G)\}$ is said to be a random $(k,m)$-list-assignment if for every $v\in V(G)$ the list…