solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看123次
Fast strategies in biased Maker--Breaker games. (arXiv:1602.04985v4 [math.CO] UPDATED)
来源于:arXiv
We study the biased $(1:b)$ Maker--Breaker positional games, played on the
edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias
$b$, possibly depending on $n$, we determine the bounds for the minimal number
of moves, depending on $b$, in which Maker can win in each of the two standard
graph games, the Perfect Matching game and the Hamilton Cycle game. 查看全文>>