Hamilton Cycles in Random Lifts of Graphs

Tomasz Łuczak, Łukasz Witkowski, Marcin Witkowski

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 corr…