3 papers
math.CO2026
Coloring powers of random graphs
Alan Frieze, Ross Kang, Aditya Raut +2
Given a graph and an integer , the th power of is the graph obtained from by adding edges for all pairs of distinct vertices at distance at most fr…
math.CO2024
The maximum degree of the th power of a sparse random graph
Alan Frieze, Aditya Raut
Let denote the th power of the random graph , where for a positive constant . We prove that w.h.p. the maximum degree $Δ\left(G^r_{n,p}\right)\si…
math.CO2023
A note on the chromatic number of the square of a sparse random graph
Alan Frieze, Aditya Raut
We show that w.h.p the list chromatic number of the square of for is asymptotically equal to the maximum degree . Since $χ(G^2_{n,p})\leq χ_\…