On the threshold for rainbow connection number r in random graphs

Annika Heckel, Oliver Riordan

We call an edge colouring of a graph G a rainbow colouring if every pair of vertices is joined by a rainbow path, i.e., a path where no two edges have the same colour. The minimum…