A note on the chromatic number of the square of a sparse random graph
arXiv:2312.03563
Abstract
We show that w.h.p the list chromatic number of the square of for is asymptotically equal to the maximum degree . Since , this also improves an earlier result of Garapaty et al \cite{KLMP} who proved that w.h.p.