关于多强盗破坏数
On the Multi-Robber Damage Number
AI总结:
研究警察与强盗游戏中强盗破坏顶点的问题,验证并改进了关于警察可拯救顶点数的猜想,并首次研究两警察两强盗情形。
摘要:
我们研究图上警察与强盗游戏的一个变体,其中强盗破坏访问过的顶点,旨在最大化被破坏的顶点数。对于一名警察对抗 $s$ 个强盗的游戏,Carlson、Halloran 和 Reinhart 提出一个猜想:只要基础图的最大度至少为 $\binom{s}{2} + 2$,警察就能拯救三个顶点不被破坏。我们能够验证该猜想,并证明在假设基础图无三角形的情况下该界是紧的。我们还研究了没有该假设的游戏,完全否定了该猜想的一般形式,并进一步尝试定位保证警察能对抗 $s$ 个强盗拯救三个顶点的基础图的最小最大度。我们证明这个数介于 $2\binom{s}{2} - 3$ 和 $2\binom{s}{2} + 1$ 之间。此外,在之前游戏已被研究过一名警察对多个强盗以及一名强盗对多个警察之后,我们首次研究了两名警察对两名强盗的游戏。当基础图是圈时,我们确定了被破坏顶点的确切数量。另外,当基础图是路时,我们给出了相差一个加法常数的界。
英文摘要:
We study a variant of the Cops and Robbers game on graphs in which the robbers damage the visited vertices, aiming to maximize the number of damaged vertices. For that game with one cop against $s$ robbers a conjecture was made by Carlson, Halloran and Reinhart that the cop can save three vertices from being damaged as soon as the maximum degree of the base graph is at least $\binom{s}{2} + 2$. We are able to verify the conjecture and prove that it is tight once we add the assumption that the base graph is triangle free. We also study the game without that assumption, disproving the conjecture in full generality and further attempting to locate the smallest maximum degree of a base graph which guarantees that the cop can save three vertices against $s$ robbers. We show that this number is between $2\binom{s}{2} - 3$ and $2\binom{s}{2} + 1$. Furthermore, after the game has been previously studied with one cop and multiple robbers, as well as with one robber and multiple cops, we initiate the study of the game with two cops and two robbers. In the case when the base graph is a cycle we determine the exact number of damaged vertices. Additionally, when the base graph is a path we provide bounds that differ by an additive constant.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。