arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.3447math.CO
收藏

弱和强k-连通对策

Weak and Strong k-connectivity games

Asaf Ferber, Dan Hefetz

摘要:

对于正整数$k$,我们考虑$k$ -顶点连通性博弈,在$K_n$的边集上进行,$n$顶点上的完全图。我们首先研究这个游戏的庄家-断路器版本,并证明,对于任何整数$k \geq 2$和足够大的$n$,庄家有一个策略赢得这个游戏内$\lfloor k n/2 \rfloor + 1$移动,这显然是最好的可能。这回答了Hefetz、Krivelevich、Stojaković和Szabó的一个问题。然后我们考虑强$k$ -顶点连通性博弈。对于每一个正整数$k$和足够大的$n$,我们描述了一个明确的第一个球员的获胜策略,这个游戏。

英文摘要:

For a positive integer $k$ we consider the $k$-vertex-connectivity game, played on the edge set of $K_n$, the complete graph on $n$ vertices. We first study the Maker-Breaker version of this game and prove that, for any integer $k \geq 2$ and sufficiently large $n$, Maker has a strategy for winning this game within $\lfloor k n/2 \rfloor + 1$ moves, which is clearly best possible. This answers a question of Hefetz, Krivelevich, Stojaković and Szabó. We then consider the strong $k$-vertex-connectivity game. For every positive integer $k$ and sufficiently large $n$, we describe an explicit first player's winning strategy for this game.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑