A note on the road-coloring conjecture (Q2713622)

This paper contains some results related to the road-coloring conjecture of Alder, Goodwyn, and Weiss. Using probabilistic methods, it is shown that if \(\delta =\Omega (\log n)\), then the road-coloring conjecture is true for almost every strongly connected aperiodic directed graph on \(n\) vertices of outdegree \(\delta \). An \(O(n^2)\) algorithm for determining whether or not a particular road-coloring is a resolving one is also given.