The Biased Odd Cycle Game

[摘要] In this paper we consider biased Maker-Breaker games played on the edge set of a given graph $G$. We prove that for every $\delta>0$ and large enough $n$, there exists a constant $k$ for which if $\delta(G)\geq \delta n$ and $\chi(G)\geq k$, then Maker

[学科分类] 离散数学和组合数学

[关键词] Graph theory;Positional games.