Random-Player Maker-Breaker games

Electronic Journal Of Combinatorics

Michael Krivelevich¹ 

关键词: Graph theory;    Random graphs;    Positional games;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In a $(1:b)$ Maker-Breaker game, one of the central questions is to find the maximal value of $b$ that allows Maker to win the game (that is, the critical bias $b^*$). Erdős conjectured that the critical bias for many Maker-Breaker games played on the edg

【 授权许可】

Others