English
Related papers

Related papers: Large-scale geometry of the saddle connection grap…

200 papers

Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in…

Combinatorics · Mathematics 2020-04-07 R. Reyes , J. M. Rodriguez , J. M. Sigarreta , M. Villeta

Tutte proved that 4-connected planar graphs are Hamiltonian. It is unknown if there is an analogous result on 1-planar graphs. In this paper, we characterize 4-connected 1-planar chordal graphs, and show that all such graphs are…

Combinatorics · Mathematics 2024-04-25 Licheng Zhang , Yuanqiu Huang , Shengxiang Lv , Fengming Dong

We describe unicorn paths in the arc graph and show that they form 1-slim triangles and are invariant under taking subpaths. We deduce that all arc graphs are 7-hyperbolic. Considering the same paths in the arc and curve graph, this also…

Geometric Topology · Mathematics 2013-01-24 Sebastian Hensel , Piotr Przytycki , Richard C. H. Webb

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

Group Theory · Mathematics 2024-12-17 Murray Elder , Giles Gardam , Adam Piggott , Davide Spriano , Kane Townsend

The existence of Hamiltonian cycles in 1-planar graphs with higher connectivity has attracted considerable attention. Recently, the authors and Dong proved that 4-connected 1-planar chordal graphs are Hamiltonian-connected. In this paper,…

Combinatorics · Mathematics 2024-11-05 Licheng Zhang , Shengxiang Lv , Yuanqiu Huang

Let $N$ be a connected finite type nonorientable surface with or without boundary components and punctures. We prove that the graph of nonseparating curves of $N$ is connected and Gromov hyperbolic with a constant which does not depend on…

Geometric Topology · Mathematics 2024-01-25 Erika Kuno

A graph is said to be {\em half-arc-transitive} if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so called…

Combinatorics · Mathematics 2007-05-23 Primoz Sparl

We prove that the asymptotic number of pairs of saddle connections with length smaller than $L$ with bounded virtual area is quadratic for almost every translation surface with respect to any ergodic $SL(2,\mathbb{R})$-invariant measure. A…

Dynamical Systems · Mathematics 2022-10-14 Etienne Bonnafoux

For a half-translation surface (S,q), the associated saddle connection complex A(S,q) is the simplicial complex where vertices are the saddle connections on (S,q), with simplices spanned by sets of pairwise disjoint saddle connections. This…

Geometric Topology · Mathematics 2022-03-23 Valentina Disarlo , Anja Randecker , Robert Tang

We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of…

Combinatorics · Mathematics 2019-12-06 Matthias Hamann

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…

Mathematical Physics · Physics 2015-06-12 Rogério G. Alves , Aldo Procacci , Remy Sanchis

We examine a graph $\Gamma$ encoding the intersection of hyperplane carriers in a CAT(0) cube complex $\widetilde X$. The main result is that $\Gamma$ is quasi-isometric to a tree. This implies that a group $G$ acting properly and…

Group Theory · Mathematics 2015-03-18 Mark F. Hagen

We investigate the connections between tree amalgamations and quasi-isometries. In particular, we prove that the quasi-isometry type of multi-ended accessible quasi-transitive connected locally finite graphs is determined by the…

Combinatorics · Mathematics 2018-12-13 Matthias Hamann

We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…

We show that any group that is hyperbolic relative to virtually nilpotent subgroups, and does not admit peripheral splittings, contains a quasi-isometrically embedded copy of the hyperbolic plane. In natural situations, the specific…

Group Theory · Mathematics 2020-11-09 John M. Mackay , Alessandro Sisto

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…

Logic · Mathematics 2025-04-02 Ruiyuan Chen , Antoine Poulin , Ran Tao , Anush Tserunyan

We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of…

Group Theory · Mathematics 2012-07-10 M. Burger , A. Iozzi , N. Monod

Translation surfaces with poles correspond to meromorphic differentials on compact Riemann surfaces. They appear in compactifications of strata of the moduli space of Abelian differentials and in the study of stability conditions. Such…

Geometric Topology · Mathematics 2016-10-20 Guillaume Tahar

We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…

Group Theory · Mathematics 2026-03-17 Koichi Oyakawa

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

Combinatorics · Mathematics 2007-05-23 Dragan Marusic , Primoz Sparl