PATTERN COLORED HAMILTON CYCLES IN RANDOM GRAPHS

被引：3
|
作者：
Anastos, Michael [1 ]
Frieze, Alan [1 ]
机构：
[1] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2019年 / 33卷 / 01期
关键词：
random graphs; Hamilton cycles; edge colored;
D O I：
10.1137/17M1149420
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string Pi over a set of colors {1, 2,..., r}, we say that a Hamilton cycle is Pi-colored if the pattern repeats at intervals of length vertical bar Pi vertical bar as we go around the cycle. We prove a hitting time result for the existence of such a cycle. We also prove a hitting time result for the related notion of Pi-connected.
引用
收藏
页码：528 / 545
页数：18
相关论文
共 50 条
12345