Clemens, DennisDennisClemensFerber, AsafAsafFerberGlebov, RomanRomanGlebovHefetz, DanDanHefetzLiebenau, AnitaAnitaLiebenau2021-12-082021-12-082015-09-15SIAM Journal on Discrete Mathematics 29 (3): 1683-1705 (2015-01-01)http://hdl.handle.net/11420/11235For 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 a copy of T. We prove that if T has bounded maximum degree and n is sufficiently large, then Maker can win this game within n + 1 moves. Moreover, we prove that Maker can build almost every tree on n vertices in n - 1 moves and provide nontrivial examples of families of trees which Maker cannot build in n - 1 moves.1095-71462015316831705Maker-Breaker gamesPositional gamesSpanning treesMathematikJournal Article10.1137/140976054Other