Related papers: Paths in graphs: bounded geometry and property A

A bounded curvature path is a continuously differentiable piecewise $C^2$ path with a bounded absolute curvature that connects two points in the tangent bundle of a surface. In this work, we analyze the homotopy classes of bounded curvature…

We prove the following two results for a given uniformly locally finite metric space with Yu's property A: 1) The group of outer automorphisms of its uniform Roe algebra is isomorphic to its group of bijective coarse equivalences modulo…

We study the Universal Difference Property (UDP) introduced by Alt{\i}nok, Anders, Arreola, Asencio, Ireland, Sar{\i}o\u{g}lan, and Smith, focusing on the relationship between the structural properties of a graph and UDP. We present…

A graph with vertex set $\{1,\ldots,n\}$ is terrain-like if, for any edge pair $\{a,c\},\{b,d\}$ with $a<b<c<d$, the edge $\{a,d\}$ also exists. Terrain-like graphs frequently appear in geometry in the context of visibility graphs. We show…

Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…

For a digraph $G$ without multisquares and a field $\mathbb{F}$, we construct a basis of the vector space of path $n$-chains $\Omega_n(G;\mathbb{F})$ for $n\geq 0$, generalising the basis of $\Omega_3(G;\mathbb{F})$ constructed by…

In this paper, new graphs $G_\tau=\left(V,E\right)$ are constructed from the discrete topological space $(X,\tau)\ $ . Several properties of this type of graphs are given such that: the clique number equals the number of elements in X also…

The paper introduces the class of O-metric spaces, a novel generalization of metric-type spaces, classifying almost all possible metric types into upward and downward O-metrics. We list some topologies arising from O-metrics and discuss…

We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…

This paper is devoted to the study of isometrically homogeneous spaces from the view point of metric geometry. Mainly we focus on those spaces that are homeomorphic to lines. One can reduce the study to those distances on $\R$ that are…

We prove that if the prime graphs in a graph class have bounded lettericity, then the entire class has bounded lettericity if and only if it does not contain arbitrary large matchings, co-matchings, or a family of graphs that we call…

In this survey we present a generalization of the notion of metric space and some applications to discrete structures as graphs, ordered sets and transition systems. Results in that direction started in the middle eighties based on the…

In this short note, we give a complete answer to the question of when the generalised F\o lner sets exhibiting property A can be chosen to be subsets of the space itself. More precisely, we prove that this holds for any discrete metric…

Given a finite directed graph with $n$ vertices, we define a metric $d_G$ on $\mathbb{F}_q^n$, where $\mathbb{F}_q$ is the finite field with $q$ elements. The weight of a word is defined as the number of vertices that can be reached by a…

In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…

A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…

We prove that a metric space with subexponential asymptotic dimension growth has Yu's property A.

The metric representation of a vertex $u$ in a connected graph $G$ respect to an ordered vertex subset $W=\{\omega_1, \dots , \omega_n\}\subset V(G)$ is the vector of distances $r(u\vert W)=(d(u,\omega_1), \dots , d(u,\omega_n))$. A vertex…

Menger's Edge Theorem asserts that there exist $k$ pairwise edge-disjoint paths between two vertices in an undirected graph if and only if a deletion of any $k-1$ or less edges does not disconnect these two vertices. Alternatively, there…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…