Related papers: Cops and robbers for hyperbolic and virtually free…

We show that if $G$ is a finitely generated group hyperbolic relative to a finite collection of subgroups $\mathcal{P}$, then the natural action of $G$ on the geodesic boundary of the associated relative Cayley graph induces a hyperfinite…

The paper consists of two parts. In the first one we show that a relatively hyperbolic group $G$ splits as a star graph of groups whose central vertex group is finitely generated and the other vertex groups are maximal parabolic subgroups.…

We study the number of ends of a Schreier graph of a hyperbolic group. Let G be a hyperbolic group and let H be a subgroup of G. In general, there is no algorithm to compute the number of ends of a Schreier graph of the pair (G, H).…

In this article, we define a locally finite graph $X$ as $\eta$-polynomially hyperbolic if there exists a Lipschitz map $\varphi : X \to Z$ to some hyperbolic space $Z$ satisfying the following condition: there exists $C \geq 0$ such that…

Given a finite simplicial graph $\Gamma=(V,E)$ with a vertex-labelling $\varphi:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}$, the graph product $G_\Gamma$ is the free product of the vertex groups $\varphi(v)$…

We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…

Suppose $G$ is a finitely presented group that is hyperbolic relative to ${\bf P}$ a finite collection of 1-ended finitely generated proper subgroups of $G$. If $G$ and the ${\bf P}$ are 1-ended and the boundary $\partial (G,{\bf P})$ has…

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…

We prove that for a one-ended hyperbolic graph $X$, the size of the quotient $X/G$ by a group $G$ acting freely and cocompactly bounds from below the number of simplices in an Eilenberg-MacLane space for $G$. We apply this theorem to show…

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…

For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…

Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number. In this paper, we get a novel upper bound on the maximum anti-forcing number of $G$…

We show that a one-ended simply connected at infinity hyperbolic group $G$ with enough codimension-1 surface subgroups has $\partial G \cong \mathbb{S}^2$. Combined with a result of Markovic, our result gives a new characterization of…

Let S be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph S, which we call canonical parabolic subgroups. A natural extension of the definition…

We show that the Gromov boundary of the free product of two infinite hyperbolic groups is uniquely determined up to homeomorphism by the homeomorphism types of the boundaries of its factors. We generalize this result to graphs of hyperbolic…

We study the problem of cops and robbers on the grid where the robber is allowed to move faster than the cops. It is well known that two cops are necessary and sufficient to catch the robber on any finite grid when the robber has unit…

We show that pseudo-Anosov mapping classes are generic in every Cayley graph of the mapping class group of a finite-type hyperbolic surface. Our method also yields an analogous result for rank-one CAT(0) groups and hierarchically hyperbolic…

We study a variant of the classical cop-robber game played on compact metric graphs, where each edge is assigned a positive length and identified with a real interval of corresponding length. In this setting, both the cop and the robber…

We consider a variant of Cops and Robbers wherein each edge traversed by the robber is deleted from the graph. The focus is on determining the minimum number of cops needed to capture a robber on a graph $G$, called the {\em bridge-burning…

We investigate a cheating robot version of Cops and Robber, first introduced by Huggan and Nowakowski, where both the cops and the robber move simultaneously, but the robber is allowed to react to the cops' moves. For conciseness, we refer…