A note on the chromatic number of the square of a sparse random graph
Combinatorics
2025-02-12 v6
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.
Cite
@article{arxiv.2312.03563,
title = {A note on the chromatic number of the square of a sparse random graph},
author = {Alan Frieze and Aditya Raut},
journal= {arXiv preprint arXiv:2312.03563},
year = {2025}
}