Canonical labelling of random regular graphs

Mikhail Isaev, Tamás Makai, Brendan McKay +3

We prove that whenever $d=d(n)\to \infty$ and $n-d\to \infty$ as $n\to \infty$, then with high probability for any non-trivial initial colouring, the colour refinement algorithm disti…