相关论文: Compact metric spaces with infinite cop number

In the game of \emph{cops and robbers} on a graph $G = (V,E)$, $k$ cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber's turn, he moves similarly. The cops win if there is…

In many variants of the game of Cops and Robbers on graphs, multiple cops play against a single robber. In 2019, Cox and Sanaei introduced a variant of the game that gives the robber a more active role than simply evading the cop. In their…

We study a game of pursuit and evasion introduced by Seager in 2012, in which a cop searches the robber from outside the graph, using distance queries. A graph on which the cop wins is called locatable. In her original paper, Seager asked…

Introduced by Harris, Insko, Prieto Langarica, Stoisavljevic, and Sullivan, the \emph{tipsy cop and drunken robber} is a variant of the cop and robber game on graphs in which the robber simply moves randomly along the graph, while the cop…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

We study the Localization game on locally finite graphs trees, where each of the countably many vertices have finite degree. In contrast to the finite case, we construct a locally finite tree with localization number $n$ for any choice of…

The game of cops and robbers, played on a fixed graph $G$, is a two-player game, where the cop and the robber (the players) take turns in moving to adjacent vertices. The game finishes if the cop lands on the robber's vertex. In that case…

In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. We consider the most restictive capture condition: a…

Given a compact metric space $X$, we associate to it an inverse sequence of finite $T_0$ topological spaces. The inverse limit of this inverse sequence contains a homeomorphic copy of $X$ that is a strong deformation retract. We provide a…

This paper introduces some inverse sequences of different polyhedra all based on finite approximations of a compact metric space so they can be used to capture the shape type of the original space. It is shown that they are HPol-expansions,…

In this paper, we defined two new games - the mildly Menger game and the compact-clopen game. In a zero-dimensional space, the Menger game is equivalent to the mildly Menger game and the compact-open game is equivalent to the compact-clopen…

We discuss winning possibilities of players in various variants of cops and robber game played on large random graphs, a testbed for various kinds of network queries, search problems in particular. We explore the use of logic frameworks to…

Given a compact Riemannian manifold with boundary, we prove that the space of embedded, which may be improper, free boundary minimal hypersurfaces with uniform area and Morse index upper bound is compact in the sense of smoothly graphical…

The weak-cop number of a graph, a variation of the cop number, is an invariant suitable for infinite graphs and is a quasi-isometric invariant. While for any $m\in\mathbb{Z}_+\cup\{\infty\}$ there exist locally finite infinite graphs with…

We consider the cop-throttling number of a graph $G$ for the game of Cops and Robbers, which is defined to be the minimum of $(k + \text{capt}_k(G))$, where $k$ is the number of cops and $\text{capt}_k(G)$ is the minimum number of rounds…

Cops and Robbers games have been studied for the last few decades in computer science and mathematics. As in general pursuit evasion games, pursuers (cops) seek to capture evaders (robbers); however, players move in turn and are constrained…

This paper is a contribution to the classical cops and robber problem on a graph, directed to two-dimensional grids and toroidal grids. These studies are generally aimed at determining the minimum number of cops needed to capture the robber…

We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter $\ell$. We consider the basic consequences of this definition for some simple graph…

We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for dense graphs. The flip-width parameters are defined using…

We consider the Robber Locating Game, where an invisible moving robber tries to evade the pursuit of one or more helicopter cops, who send distance probes from anywhere on the graph. In this paper, we attempt to propose two useful…