Rainbow Hamilton cycles in random regular graphs

被引：14
|
作者：
Janson, Svante
Wormald, Nicholas
机构：
[1] Uppsala Univ, Dept Math, SE-75106 Uppsala, Sweden
[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
来源：
RANDOM STRUCTURES & ALGORITHMS | 2007年 / 30卷 / 1-2期
关键词：
D O I：
10.1002/rsa.20146
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A rainbow subgraph of an edge-colored graph has all edges of distinct colors. A random d-regular graph with d even, and having edges colored randomly with d/2 of each of it colors, has a rainbow Hamilton cycle with probability tending to I as it -> infinity , for fixed d >= 8. (c) 2006 Wiley Periodicals. Inc.
引用
收藏
页码：35 / 49
页数：15
相关论文
共 50 条
12345