arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0110049cs.DMcs.CC
收藏

图回避对策中的一种对称策略

A Symmetric Strategy in Graph Avoidance Games

Frank Harary, Wolfgang Slany, Oleg Verbitsky

摘要:

在图回避博弈中,两个博弈者交替地将图G的边分别涂成红色和蓝色。首先创建一个与禁止图F同构的单色子图的玩家输了。第二个参与者的对称策略确保,独立于第一个参与者的策略,蓝色和红色子图在每一轮游戏之后都是同构的。我们解决的类,这些图G承认所有F的对称策略,并讨论相关的图论和复杂性问题。我们还展示了一些例子,虽然G上的对称策略一般不存在,但它仍然适用于特定的F。

英文摘要:

In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who first creates a monochromatic subgraph isomorphic to a forbidden graph F loses. A symmetric strategy of the second player ensures that, independently of the first player's strategy, the blue and the red subgraph are isomorphic after every round of the game. We address the class of those graphs G that admit a symmetric strategy for all F and discuss relevant graph-theoretic and complexity issues. We also show examples when, though a symmetric strategy on G generally does not exist, it is still available for a particular F.

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

↑