2005/08/08 by Svante Janson, Janson, Svante, Nicholas Wormald +1
Mathematics · #05C15 #05C45 #05C80 (Primary) #60C05 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR) #math.CO #math.PR #msc:05C15 #msc:05C45 #msc:05C80 #msc:60C05
paper · pdf · doi:10.48550/arxiv.math/0508145
16 pages
arxiv created 2005/08/08 · arxiv updated 2009/12/01
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n tends to infinity, provided d is at least 8.