Dan Hefetz

Building Spanning Trees Quickly in Maker-Breaker Games

2015 · SIAM Journal on Discrete Mathematics

For a tree $T$ on $n$ vertices, we study the Maker-Breaker game, played on the edge set of the complete graph on $n$ vertices, which Maker wins as soon as the graph she builds contains …