792 research outputs found
Cop and robber game and hyperbolicity
In this note, we prove that all cop-win graphs G in the game in which the
robber and the cop move at different speeds s and s' with s'<s, are
\delta-hyperbolic with \delta=O(s^2). We also show that the dependency between
\delta and s is linear if s-s'=\Omega(s) and G obeys a slightly stronger
condition. This solves an open question from the paper (J. Chalopin et al., Cop
and robber games when the robber can hide and ride, SIAM J. Discr. Math. 25
(2011) 333-359). Since any \delta-hyperbolic graph is cop-win for s=2r and
s'=r+2\delta for any r>0, this establishes a new - game-theoretical -
characterization of Gromov hyperbolicity. We also show that for weakly modular
graphs the dependency between \delta and s is linear for any s'<s. Using these
results, we describe a simple constant-factor approximation of the
hyperbolicity \delta of a graph on n vertices in O(n^2) time when the graph is
given by its distance-matrix
Bucolic Complexes
We introduce and investigate bucolic complexes, a common generalization of
systolic complexes and of CAT(0) cubical complexes. They are defined as simply
connected prism complexes satisfying some local combinatorial conditions. We
study various approaches to bucolic complexes: from graph-theoretic and
topological perspective, as well as from the point of view of geometric group
theory. In particular, we characterize bucolic complexes by some properties of
their 2-skeleta and 1-skeleta (that we call bucolic graphs), by which several
known results are generalized. We also show that locally-finite bucolic
complexes are contractible, and satisfy some nonpositive-curvature-like
properties.Comment: 45 pages, 4 figure
Cops, robbers, and infinite graphs
Cops and robbers is a game between two players, where one tries to catch the
other by moving along the edges of a graph. It is well known that on a finite
graph the cop has a winning strategy if and only if the graph is constructible
and that finiteness is necessary for this result.
We propose the notion of weakly cop-win graphs, a winning criterion for
infinite graphs which could lead to a generalisation. In fact, we generalise
one half of the result, that is, we prove that every constructible graph is
weakly cop-win. We also show that a similar notion studied by Chastand et al.
(which they also dubbed weakly cop-win) is not sufficient to generalise the
above result to infinite graphs.
In the locally finite case we characterise the constructible graphs as the
graphs for which the cop has a so-called protective strategy and prove that the
existence of such a strategy implies constructibility even for non-locally
finite graphs
A combinatorial non-positive curvature I: weak systolicity
We introduce the notion of weakly systolic complexes and groups, and initiate
regular studies of them. Those are simplicial complexes with
nonpositive-curvature-like properties and groups acting on them geometrically.
We characterize weakly systolic complexes as simply connected simplicial
complexes satisfying some local combinatorial conditions. We provide several
classes of examples --- in particular systolic groups and CAT(-1) cubical
groups are weakly systolic. We present applications of the theory, concerning
Gromov hyperbolic groups, Coxeter groups and systolic groups.Comment: 35 pages, 1 figur
- …