A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process

Pu Gao, Calum MacRury, Pawel Pralat

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the pla…