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.
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-6997801 Tel Aviv, IsraelTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-6997801 Tel Aviv, Israel
Krivelevich, Michael
Lee, Choongbum
论文数: 0引用数: 0
h-index: 0
机构:
MIT, Dept Math, Cambridge, MA 02139 USATel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-6997801 Tel Aviv, Israel
Lee, Choongbum
Sudakov, Benny
论文数: 0引用数: 0
h-index: 0
机构:
ETH, Dept Math, CH-8092 Zurich, SwitzerlandTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-6997801 Tel Aviv, Israel