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

在树上抓老鼠

Catching a mouse on a tree

Vytautas Gruslys, Arès Méroueh

摘要:

本文考虑图上的一个追逃对策。一队猫,可以选择图中的任何顶点,试图抓住一只看不见的老鼠,这只老鼠被限制沿着图的顶点移动。我们的重点是树木。我们证明了$\lceil (1/2)\log_2(n)\rceil$猫总是可以赶上一只老鼠的树顺序$n$,并给出了一个收集的树,老鼠可以避免被抓到的$ (1/4 - o(1))\log_2(n)$猫。

英文摘要:

In this paper we consider a pursuit-evasion game on a graph. A team of cats, which may choose any vertex of the graph at any turn, tries to catch an invisible mouse, which is constrained to moving along the vertices of the graph. Our main focus shall be on trees. We prove that $\lceil (1/2)\log_2(n)\rceil$ cats can always catch a mouse on a tree of order $n$ and give a collection of trees where the mouse can avoid being caught by $ (1/4 - o(1))\log_2(n)$ cats.

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

↑