Related papers: Splittings and C-complexes
The topology of the Bowditch boundary of a relatively hyperbolic group pair gives information about relative splittings of the group. It is therefore interesting to ask if there is generic behavior of this boundary. The purpose of this…
Consider an interacting particle system indexed by the vertices of a (possibly random) locally finite graph whose vertices and edges are equipped with marks representing parameters of the model such as the environment and initial…
Suppose that $X$ is an infinite, connected, locally finite, quasi-transitive graph with the property that every bi-infinite quasi-geodesic uniformly coarsely separates $X$ into exactly two deep pieces. We show that such an $X$ is…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
We construct hyperbolic groups with the following properties: The boundary of the group has big dimension, it is separated by a Cantor set and the group does not split. This shows that Bowditch's theorem that characterizes splittings of…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
We introduce the notion of finite stature of a family $\{H_i\}$ of subgroups of a group $G$. We investigate the separability of subgroups of a group $G$ that splits as a graph of hyperbolic special groups with quasiconvex edge groups. We…
We study relations between maps between relatively hyperbolic groups/spaces and quasisymmetric embeddings between their boundaries. More specifically, we establish a correspondence between (not necessarily coarsely surjective)…
We characterize sequences of Kleinian surface groups with convergent subsequences in terms of the asymptotic behavior of the ending invariants of the associated hyperbolic 3-manifolds. Asymptotic behavior of end invariants in a convergent…
We introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras…
A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…
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…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…
We prove that any quasirandom uniform hypergraph $H$ can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our results also apply to multipartite hypergraphs and even to the…
A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope…