Rainbow Hamilton cycles in random regular graphs
组合数学
2007-05-23 v1 概率论
摘要
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.
引用
@article{arxiv.math/0508145,
title = {Rainbow Hamilton cycles in random regular graphs},
author = {Svante Janson and Nicholas Wormald},
journal= {arXiv preprint arXiv:math/0508145},
year = {2007}
}
备注
16 pages