Rainbow Hamilton cycles in random regular graphs
classification
🧮 math.CO
math.PR
keywords
rainbowcoloursedgesgraphhamiltonrandomcolouredcycle
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.