Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds

Abstract

The semi-random graph process is an adaptive random graph process in which an online algorithm is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the algorithm independently and uniformly at random. The algorithm then adaptively selects a vertex $v$, and adds the edge $uv$ to the graph. For a given graph property, the objective of the algorithm is to force the graph to satisfy this property asymptotically almost surely in as few rounds as possible. We focus on the property of Hamiltonicity. We present an adaptive strategy which creates a Hamiltonian cycle in $\alpha n$ rounds, where $\alpha < 1.81696$ is derived from the solution to a system of differential equations. We also show that achieving Hamiltonicity requires at least $\beta n$ rounds, where $\beta > 1.26575$.