A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Rainbow Connection of Random Regular Graphs
2015
SIAM Journal on Discrete Mathematics
An edge colored graph G is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this work we study the rainbow connection of the random r-regular graph G = G(n, r) of order n, where r ≥ 4 is a constant. We prove that with probability tending to one as n goes to infinity the rainbow connection of
doi:10.1137/140998433
fatcat:xfykkk3b2rapjdownnmth4wlty