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.
机构:
Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USACarnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
Espig, Lisa
论文数: 引用数:
h-index:
机构:
Frieze, Alan
Krivelevich, Michael
论文数: 0引用数: 0
h-index: 0
机构:
Tel Aviv Univ, Sch Math Sci, Raymond & Beverly Sackler Fac Exact Sci, IL-6997801 Tel Aviv, IsraelCarnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
机构:
Univ Nebraska Lincoln, Dept Math, Lincoln, NE USA
Univ Nebraska Lincoln, Dept Math, Lincoln, NE 68588 USACarnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA USA