English
Related papers

Related papers: Asymptotic structure. II. Path-width and additive …

200 papers

Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every…

Combinatorics · Mathematics 2025-09-16 Tung Nguyen , Alex Scott , Paul Seymour

In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a…

Combinatorics · Mathematics 2025-09-08 Tung Nguyen , Alex Scott , Paul Seymour

As proved by Kahn, the chromatic number and fractional chromatic number of a line graph agree asymptotically. That is, for any line graph $G$ we have $\chi(G) \leq (1+o(1))\chi_f(G)$. We extend this result to quasi-line graphs, an important…

Discrete Mathematics · Computer Science 2011-02-07 Andrew D. King , Bruce Reed

This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…

Combinatorics · Mathematics 2025-03-11 James Davies , Meike Hatzel , Robert Hickingbotham

Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a characterisation of graphs quasi-isometric to graphs of…

Combinatorics · Mathematics 2025-12-29 Marc Distel

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…

Combinatorics · Mathematics 2007-05-23 Bernhard Krön

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…

Group Theory · Mathematics 2022-07-20 Josiah Oh , Mark Pengitore

Let $\varphi:F_1\to F_2$ be an injective morphism of free groups. If $\varphi$ is geometric (i.e. induced by an inclusion of oriented compact connected surfaces with nonempty boundary), then we show that $\varphi$ is an isometric embedding…

Geometric Topology · Mathematics 2025-01-28 Alexis Marchand

We consider admissible random walks on hyperbolic graphs. For a given harmonic function on such a graph, we prove that asymptotic properties of non-tangential boundedness and non-tangential convergence are almost everywhere equivalent. The…

Metric Geometry · Mathematics 2013-03-12 Camille Petit

A homogeneous quasimorphism $\phi$ on a normal subgroup $N$ of $G$ is said to be $G$-invariant if $\phi(gxg^{-1}) = \phi(x)$ for every $g \in G$ and for every $x \in N$. Invariant quasimorphisms have naturally appeared in symplectic…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

Probability · Mathematics 2018-12-27 Tomasz Luczak , Abram Magner , Wojciech Szpankowski

Let U be a homogeneous variety over Q of a linear algebraic group. Choose an integral model and assume the existence of infinitely many integral points. Then one would like to give an asymptotic count of integral points of bounded height…

Dynamical Systems · Mathematics 2024-11-27 Runlin Zhang

We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).

Geometric Topology · Mathematics 2011-08-23 Oleksii Kuchaiev , Anastasiia Tsvietkova

It is an easy observation that if a graph~$G$ admits a path-decomposition whose parts have small radius, then $G$ contains no large subdivision of $K_{1,3}$ or $K^3$ as a (quasi-)geodesic subgraph. We show that these are in fact the only…

We call a digraph {\em $h$-semicomplete} if each vertex of the digraph has at most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u \neq v$ such that there is no edge between $u$ and $v$ in either direction. This…

Data Structures and Algorithms · Computer Science 2015-07-08 Kenta Kitsunai , Yasuaki Kobayashi , Hisao Tamaki

In this article, we study and analyze the \phi-sectional curvature induced by a statistical structure on an almost contact metric manifold. We demonstrate that this sectional curvature is always non-positive. Additionally, we present…

Differential Geometry · Mathematics 2025-07-02 Abbas Heydari , Sadegh Mohammadi

Path-addition is an operation that takes a graph and adds an internally vertex-disjoint path between two vertices together with a set of supplementary edges. Path-additions are just the opposite of taking minors. We show that some classes…

Discrete Mathematics · Computer Science 2016-05-11 Franz J. Brandenburg , Alexander Esch , Daniel Neuwirth

Let $X$ be a geodesic metric space with $H_1(X)$ uniformly generated. If $X$ has asymptotic dimension one then $X$ is quasi-isometric to an unbounded tree. As a corollary, we show that the asymptotic dimension of the curve graph of a…

Metric Geometry · Mathematics 2014-10-01 Koji Fujiwara , Kevin Whyte

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…

Combinatorics · Mathematics 2023-05-09 Hajime Tanaka

We prove that if $G$ is a non-uniform lattice in a rank-one semi-simple Lie group $\ne Isom(\H^2_\R)$ then $G$ is quasi-isometrically co-Hopf. This means that every quasi-isometric embedding $G\to G$ is coarsely onto and thus is a…

Geometric Topology · Mathematics 2012-12-04 Ilya Kapovich , Anton Lukyanenko
‹ Prev 1 2 3 10 Next ›