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

特殊图上的奇/奇顶点去除对策分析

Analysis of Odd/odd vertex removal games on special graphs

Oliver Krüger

摘要:

我们分析了P. Ottaway提出的奇/奇顶点移除博弈。我们证明了每个二部图的Grundy值仅取决于图中边数的奇偶性,这是K的一个猜想的推广。谢尔顿我们还回答了一个问题,最初提出的谢尔顿和奥特韦的存在图的每一个Grundy值。我们证明,情况确实如此。

英文摘要:

We analyze the Odd/odd vertex removal game introduced by P. Ottaway. We prove that every bipartite graph has Grundy value 0 or 1 only depending on the parity of the number of edges in the graph, which is a generalization of a conjecture of K. Shelton. We also answer a question originally posed by both Shelton and Ottaway about the existance of graphs for every Grundy value. We prove that this is indeed the case.

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

↑