For a graph G the random n-lift of G is obtained by replacing each of its vertices by a set of n vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of G are adjacent. We show that asymptotically almost surely the random lift of a graph G is Hamiltonian, provided G has the minimum degree at least 5 and contains two disjoint Hamiltonian cycles whose union is not a bipartite graph. (C) 2015 Elsevier Ltd. All rights reserved.
机构:
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