Related papers: A strong geometric hyperbolicity property for dire…

The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive…

We show that any graph product of finitely generated groups is hierarchically hyperbolic relative to its vertex groups. We apply this result to answer two questions of Behrstock, Hagen, and Sisto: we show that the syllable metric on any…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of…

A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…

In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous…

For some geometric graph classes, tractability of testing first-order formulas is precisely characterised by the graph parameter twin-width. This was first proved for interval graphs among others in [BCKKLT, IPEC '22], where the equivalence…

Mapping class groups are known to admit geometric (proper, cobounded) actions on injective spaces. Starting with such an action, and relying only on geometric arguments, we show that all finite generating sets resulting from taking large…

We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both…

We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic…

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

We introduce the notion of delineation. A graph class $\mathcal C$ is said delineated if for every hereditary closure $\mathcal D$ of a subclass of $\mathcal C$, it holds that $\mathcal D$ has bounded twin-width if and only if $\mathcal D$…

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

A graph class is monotone if it is closed under taking subgraphs. It is known that a monotone class defined by finitely many obstructions has bounded treewidth if and only if one of the obstructions is a so-called tripod, that is, a…

While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits…

We prove a combination theorem for hyperbolic groups, in the case of groups acting on complexes displaying combinatorial features reminiscent of non-positive curvature. Such complexes include for instance weakly systolic complexes and…

We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned-off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented)…