Keeping Avoider's Graph Almost Acyclic

Electronic Journal Of Combinatorics

Dennis Clemens¹ 

关键词: Positional games;    Avoider-Enforcer;    planarity game;    threshold bias;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 \geq 200 n \ln n$. By this we obtain essentia

【 授权许可】

Others