Related papers: Splittings and C-complexes

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…

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…

We introduce an obstruction to the existence of a coarse embedding of a given group or space into a hyperbolic group, or more generally into a hyperbolic graph of bounded degree. The condition we consider is "admitting exponentially many…

A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

This paper contains a thorough investigation of invariant distributions supported on limit sets of discrete groups acting convex cocompactly on symmetric spaces of negative curvature. It can be considered as a continuation of…

We prove that the fundamental group of a finite graph of convergence groups with parabolic edge groups is a convergence group. Using this result, under some mild assumptions, we prove a combination theorem for a graph of convergence groups…

Let $1 \to K \longrightarrow G \stackrel{\pi}\longrightarrow Q$ be an exact sequence of hyperbolic groups. Let $Q_1 < Q$ be a quasiconvex subgroup and let $G_1=\pi^{-1}(Q_1)$. Under relatively mild conditions (e.g. if $K$ is a closed…

Epidemic spreading is well understood when a disease propagates around a contact graph. In a stochastic susceptible-infected-susceptible setting, spectral conditions characterise whether the disease vanishes. However, modelling human…

We show that the identity component of the group of diffeomorphisms of a closed oriented surface of positive genus admits many unbounded quasi-morphisms. As a corollary, we also deduce that this group is not uniformly perfect and its…

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…

We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of 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…

Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Let G be a group which is hyperbolic relative to a collection of subgroups A, and it is also hyperbolic relative to a collection of subgroups B. Suppose that the collection A contains B. We characterize, for subgroups of G, when…

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…

We expand the structural theory of \ca graphs that avoid specific cyclic coset patterns. We present several characterisations of tree-likeness for these structures and show a close connection to $\alpha$-acyclic hypergraphs. A focus lies on…

The minimum $s$-$t$ cut problem in graphs is one of the most fundamental problems in combinatorial optimization, and graph cuts underlie algorithms throughout discrete mathematics, theoretical computer science, operations research, and data…

We show that an intricate relation of cluster properties and optimal bipartitions, which takes place in undirected random graphs, extends to directed and mixed random graphs. In particular, the satisfability threshold coincides with the…