A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We consider biased (1:b) Avoider-Enforcer games in the monotone and strict versions. In particular, we show that Avoider can keep his graph being a forest for every but maybe the last round of the game if b ≥ 200 n n. By this we obtain essentially optimal upper bounds on the threshold biases for the non-planarity game, the non-k-colorability game, and the K_t-minor game thus addressing a question and improving the results of Hefetz, Krivelevich, Stojaković, and Szabó. Moreover, we give a slightarXiv:1403.1482v1 fatcat:6q2xe4szuffy3ptzinvbrq4riu