Related papers: Graphs with convex balls

We show that a group that is hyperbolic relative to strongly shortcut groups is itself strongly shortcut, thus obtaining new examples of strongly shortcut groups. The proof relies on a result of independent interest: we show that every…

We define an operation on finite graphs, called co-contraction. By showing that co-contraction of a graph induces an injective map between right-angled Artin groups, we exhibit a family of graphs, without any induced cycle of length at…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

This paper presents a study of the asymptotic geometry of groups with contracting elements, with emphasis on a subclass of statistically convex-cocompact (SCC) actions. The class of SCC actions includes relatively hyperbolic groups, CAT(0)…

We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…

Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface…

Quasi-median graphs have been introduced by Mulder in 1980 as a generalisation of median graphs, known in geometric group theory to naturally coincide with the class of CAT(0) cube complexes. In his PhD thesis, the author showed that…

We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain…

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

We introduce a strong notion of quasiconvexity in finitely generated groups, which we call stability. Stability agrees with quasiconvexity in hyperbolic groups and is preserved under quasi-isometry for finitely generated groups. We show…

A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…

We introduce regular closed subgraphs of Katsura's topological graphs and use them to generalize the notion of an adjunction space from topology. Our construction attaches a topological graph onto another via a regular factor map. We prove…

Given a finite group $G$ and a subset $S\subseteq G,$ the bi-Cayley graph $\bcay(G,S)$ is the graph whose vertex set is $G \times \{0,1\}$ and edge set is $\{\{(x,0),(s x,1)\} : x \in G, s\in S \}$. A bi-Cayley graph $\bcay(G,S)$ is called…

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…

Carrier graphs of groups representing subgroups of a given relatively hyperbolic groups are introduced and a combination theorem for relatively quasi-convex subgroups is proven. Subsequently a theory of folds for such carrier graphs is…

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

In 1995, Rips and Sela asked if torsionfree hyperbolic groups admit globally stable cylinders. We establish this property for all residually finite hyperbolic groups and curve graphs of finite-type surfaces. These cylinders are fine…

A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…