Options
Keeping Avoider’s graph almost acyclic
Publikationstyp
Journal Article
Publikationsdatum
2015-03-06
Sprache
English
Institut
Enthalten in
Volume
22
Issue
1
Start Page
1
End Page
12
Article Number
P1.60
Citation
Electronic Journal of Combinatorics 22 (1): P1.60, 1-12 (2015-03-06)
Publisher DOI
Scopus ID
Publisher
EMIS ELibEMS
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 ²00nlnn. 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-minor game thus addressing a question and improving the results of Hefetz, Krivelevich, Stojakovic, and Szabo. Moreover, we give a slight improvement for the lower bound in the non-planarity game.
Schlagworte
Avoider-Enforcer
Planarity game
Positional games
Threshold bias
DDC Class
510: Mathematik