Rainbow Hamilton cycles in random regular graphs
Janson, Svante · Wormald, Nicholas
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.