Fast embedding of spanning trees in biased Maker-Breaker games

Asaf Ferber, Dan Hefetz, Michael Krivelevich

Given a tree $T=(V,E)$ on $n$ vertices, we consider the $(1:q)$ Maker-Breaker tree embedding game ${\mathcal{T}}_n$. The board of this game is the edge set of the complete graph o…