Hitting time for Hamilton cycles in pseudorandom graphs

Yaobin Chen, Yu Chen, Seonghyuk Im +1

Consider the random subgraph process on a base graph $G$ with $n$ vertices: we generate a sequence $\{G_t{\}}_{t=0}^{|E(G)|}$ by taking a uniformly random ordering of the edges of $G…