Keeping Avoider's graph almost acyclic

Dennis Clemens, Julia Ehrenmüller, Yury Person +1

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…