Optimally building spanning graphs in semirandom graph processes

Michael Anastos, Maurício Collares, Joshua Erde +3

The semirandom graph process constructs a graph $G$ in a series of rounds, starting with the empty graph on $n$ vertices. In each round, a player is offered a vertex $v$ chosen uni…