Coloring powers of random graphs

Alan Frieze, Ross Kang, Aditya Raut +2

Given a graph $G$ and an integer $r\ge 1$, the $r$th power $G^r$ of $G$ is the graph obtained from $G$ by adding edges for all pairs of distinct vertices at distance at most $r$ fr…