Rainbow Hamilton cycles in random regular graphs

Simple item page
dc.creatorJanson, Svante
dc.creatorWormald, Nicholas
dc.date2005-08-08
dc.date.accessioned2026-07-07T05:22:16Z
dc.date.available2026-07-07T05:22:16Z
dc.descriptionA 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/math/0508145
dc.identifierhttp://arxiv.org/abs/math/0508145
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75992
dc.subjectCombinatorics
dc.subjectProbability
dc.subject05C80 (Primary); 05C15, 05C45, 60C05 (Secondary)
dc.titleRainbow Hamilton cycles in random regular graphs
dc.typetext

Files

Collections

arXiv