Related papers: Graphs of hyperbolic groups and a limit set inters…
We study graphs of (generalized) joins and intersections of finitely generated subgroups of a free group. We show how to disprove a lemma of Imrich and M\"uller on these graphs and how to repair this lemma.
We introduce the \emph{intersection orbital graph} $\Gamma(G_1, G_2; \Omega)$ associated with two permutation groups $G_1, G_2 \leq \mathrm{Sym}(\Omega)$ on a finite set $\Omega$.
We consider splittings of groups over finite and two-ended subgroups. We study the combinatorics of such splittings using generalisations of Whitehead graphs. In the case of hyperbolic groups, we relate this to the topology of the boundary.…
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in…
This arXived paper has two independant parts, that are improved and corrected versions of different parts of a single paper once named "On equations in relatively hyperbolic groups". The first part is entitled "Existential questions in…
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…
There is a well-documented research programme on graph operators which addresses questions such as `Which graphs appear as images of graphs?'; `Which graphs are fixed under the operator?'; `What happens if the operator is iterated?' In this…
This is an announcement of some of the results obtained as a part of the second author's Ph.D. thesis. In the first part, we prove that the fundamental group of an acylindrical complex of hyperbolic groups with finite edge groups is…
In this paper we give new requirements that a tree of $\delta$-hyperbolic spaces has to satisfy in order to be $\delta$-hyperbolic itself. As an application, we give a simple proof that limit groups are relatively hyperbolic.
We introduce the notions of geometric height and graded (geometric) relative hyperbolicity in this paper. We use these to characterize quasiconvexity in hyperbolic groups, relative quasiconvexity in relatively hyperbolic groups, and convex…
Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation,…
In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…
An introduction to Hyperbolic Analysis is presented.
We introduce and study the notions of hyperbolically embedded and very rotating families of subgroups. The former notion can be thought of as a generalization of the peripheral structure of a relatively hyperbolic group, while the later one…
In this paper, we state two combination theorems for relatively quasiconvex subgroups in a relatively hyperbolic group. Applications are given to the separability of double cosets of certain relatively quasiconvex subgroups and the…
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 generalise a theorem of Gersten on surjectivity of the restriction map in $\ell^{\infty}$-cohomology of groups. This leads to applications on subgroups of hyperbolic groups, quasi-isometric distinction of finitely generated groups and…
This paper shows that every Gromov hyperbolic group can be described by a finite subdivision rule acting on the 3-sphere. This gives a boundary-like sequence of increasingly refined finite cell complexes which carry all quasi-isometry…
We improve recent results relating graph eigenvalues to other graph parameters like girth, domination number, and minimum degree.
We give several algorithms addressing computations of intersections of conjugate subgroups.