Linear Bounds for Cycle-free Saturation Games

Sean English, Tomáš Masařík, Grace McCourt +3

Given a family of graphs $\mathcal{F}$, we define the $\mathcal{F}$-saturation game as follows. Two players alternate adding edges to an initially empty graph on $n$ vertices, with…