English
Related papers

Related papers: Tree amalgamations and quasi-isometries

200 papers

Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility…

Discrete Mathematics · Computer Science 2012-10-16 Sudheer Vakati , David Fernández-Baca

Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…

Combinatorics · Mathematics 2025-12-02 Qingying Deng , Xian'an Jin , Qi Yan , Yexiang Yan

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…

Group Theory · Mathematics 2012-09-18 Rögnvaldur G. Möller , Jan Vonk

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

Combinatorics · Mathematics 2021-02-01 Marija Jelić Milutinović , Helen Jenne , Alex McDonough , Julianne Vega

It is known that for every $\alpha \geq 1$ there is a planar triangulation in which every ball of radius $r$ has size $\Theta(r^\alpha)$. We prove that for $\alpha <2$ every such triangulation is quasi-isometric to a tree. The result…

Metric Geometry · Mathematics 2022-05-27 Itai Benjamini , Agelos Georgakopoulos

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

Combinatorics · Mathematics 2026-05-20 Richard Mycroft , Tássio Naia

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…

Dynamical Systems · Mathematics 2022-10-07 Karl Petersen , Ibrahim Salama

For a pair $(G,\mathcal{P})$ consisting of a group and finite collection of subgroups, we introduce a simplicial $G$-complex $\mathcal{K}(G,\mathcal{P})$ called the coset intersection complex. We prove that the quasi-isometry type and the…

Group Theory · Mathematics 2026-02-25 Carolyn Abbott , Eduardo Martínez-Pedroza

The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation $A\ast_C B$ or an HNN-extension $\ast_{\phi}…

Combinatorics · Mathematics 2018-12-13 Babak Miraftab , Tim Rühmann

The article is devoted to a structure of topological spaces related with topological quasigroups. Regular and complete spaces over topological quasigroups are studied. Separations and embeddings are also investigated for them. Their…

Group Theory · Mathematics 2023-12-29 S. V. Ludkowski

We construct `structure invariants' of a one-ended, finitely presented group that describe the way in which the factors of its JSJ decomposition over two-ended subgroups fit together. For groups satisfying two technical conditions, these…

Group Theory · Mathematics 2017-04-07 Christopher H. Cashen , Alexandre Martin

We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…

Metric Geometry · Mathematics 2017-10-26 Jeff Lindquist

Let $T$ be a locally finite tree without vertices of degree $1$. We show that among the closed subgroups of $\mathrm{Aut}(T)$ acting with a bounded number of orbits, the Chabauty-closure of the set of topologically simple groups is the set…

Group Theory · Mathematics 2020-07-23 Pierre-Emmanuel Caprace , Nicolas Radu

We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…

Combinatorics · Mathematics 2024-06-24 Manuel Bodirsky , Colin Jahel

We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…

Quantum Algebra · Mathematics 2018-02-14 Marko Živković

We are motivated by the question that for which class of right-angled Artin groups (RAAG's), the quasi-isometry classification coincides with commensurability classification. This is previously known for RAAG's with finite outer…

Geometric Topology · Mathematics 2024-12-03 Jingyin Huang

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure…

Group Theory · Mathematics 2016-01-20 Sang-hyun Kim , Thomas Koberda

This is the first of two papers which aim to understand quasi-isometries of a subclass of unimodular split solvable Lie groups. In the present paper, we show that locally (in a coarse sense), a quasi-isometry between two groups in this…

Metric Geometry · Mathematics 2008-02-20 Irine Peng

We prove the rather counterintuitive result that there exist finite transitive graphs H and integers k such that the Free Uniform Spanning Forest in the direct product of the k-regular tree and H has infinitely many trees almost surely.…

Probability · Mathematics 2021-01-26 Gábor Pete , Ádám Timár

We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs, it takes into account all paths between vertices. Formally, it is defined as d(i,j)=q_{ii}+q_{jj}-q_{ij}-q_{ji}, where q_{ij}…

Combinatorics · Mathematics 2011-04-29 Pavel Chebotarev , Elena Shamis
‹ Prev 1 3 4 5 6 7 10 Next ›