Making spanning graphs

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +2

We prove that for each $D\ge 2$ there exists $c>0$ such that whenever $b\le c(\frac{n}{\log n}{)}^{1/D}$, in the $(1:b)$ Maker-Breaker game played on $E(K_n)$, Maker has a s…