arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.00066math.CO
收藏

完全图边上的服务员-顾客三角因子博弈

Waiter-Client Triangle-Factor Game on the Edges of the Complete Graph

Vojtěch Dvořák

摘要:

考虑下面的游戏,两个玩家,服务员和客户,在$K_n$的边缘(其中$n$可被$3$整除)。最初,所有的边缘都是无人认领的。在每一轮中,服务员挑选两个尚未认领的边缘。客户端然后选择这两条边中的一条添加到Waiter的图,另一条添加到Client的图。如果服务员迫使客户在某个点在客户的图中创建$K_3$ -因子,则服务员获胜,而如果她没有设法这样做,则客户获胜。不难看出,对于足够大的$n$,Waiter是有制胜策略的。克莱门斯等人考虑的问题是,如果服务员的目标是尽快获胜,客户的目标是尽可能多地拖延她,并且双方球员都发挥最佳状态,那么游戏将持续多久。用$τ_{WC}(\mathcal{F}_{n,K_3-\text{fac}},1 ) $表示此最佳轮数。Clemens等人证明了$\frac{13}{12}n \leq τ_{WC}(\mathcal{F}_{n,K_3-\text{fac}},1 ) \leq \frac{7}{6}n+o(n) $,并证实了$τ_{WC}(\mathcal{F}_{n,K_3-\text{fac}},1 ) = \frac{7}{6}n+o(n) $。在本文中,我们验证了他们的猜想。

英文摘要:

Consider the following game played by two players, called Waiter and Client, on the edges of $K_n$ (where $n$ is divisible by $3$). Initially, all the edges are unclaimed. In each round, Waiter picks two yet unclaimed edges. Client then chooses one of these two edges to be added to Waiter's graph and one to be added to Client's graph. Waiter wins if she forces Client to create a $K_3$-factor in Client's graph at some point, while if she does not manage to do that, Client wins. It is not difficult to see that for large enough $n$, Waiter has a winning strategy. The question considered by Clemens et al. is how long the game will last if Waiter aims to win as soon as possible, Client aims to delay her as much as possible, and both players play optimally. Denote this optimal number of rounds by $τ_{WC}(\mathcal{F}_{n,K_3-\text{fac}},1 ) $. Clemens et al. proved that $\frac{13}{12}n \leq τ_{WC}(\mathcal{F}_{n,K_3-\text{fac}},1 ) \leq \frac{7}{6}n+o(n) $, and conjectured that $τ_{WC}(\mathcal{F}_{n,K_3-\text{fac}},1 ) = \frac{7}{6}n+o(n) $. In this note, we verify their conjecture.

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

↑