English
Related papers

Related papers: Locally infinite graphs and symmetries

200 papers

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

Combinatorics · Mathematics 2024-02-16 Martin Otto

The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. In earlier work of Grimmett and Li, a locality theorem was proved for connective…

Combinatorics · Mathematics 2016-08-23 Geoffrey R. Grimmett , Zhongyang Li

We provide an explicit construction of finite 4-regular graphs $(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$ and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all $k\in\mathbb{N}$. For…

Group Theory · Mathematics 2022-08-25 Goulnara Arzhantseva , Arindam Biswas

We provide a geometric condition which determines whether or not every point on the metric boundary of a graph with the standard path metric is a Busemann point, that is it is the limit point of a geodesic ray. We apply this and a related…

Metric Geometry · Mathematics 2007-05-23 Corran Webster , Adam Winchester

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…

Combinatorics · Mathematics 2025-09-03 Xiwang Cao

In this paper we present some results for a connected infinite graph $G$ with finite degrees where the properties of balls of small radii guarantee the existence of some Hamiltonian and connectivity properties of $G$. (For a vertex $w$ of a…

Combinatorics · Mathematics 2021-05-10 Armen S. Asratian , Jonas B. Granholm , Nikolay K. Khachatryan

Let $R$ be a commutative ring with unity and $R^{+}$ be $Z^*(R)$ be the additive group and the set of all non-zero zero-divisors of $R$, respectively. We denote by $\mathbb{CAY}(R)$ the Cayley graph $Cay(R^+,Z^*(R))$. In this paper, we…

Combinatorics · Mathematics 2013-05-06 Ghodratollah Aalipour , Saieed Akbari

Extending and unifying a number of well-known conjectures and open questions, we conjecture that locally elliptic (that is, every element has a bounded orbit) actions by automorphisms of finitely generated groups on finite dimensional…

Group Theory · Mathematics 2025-07-14 Thomas Haettel , Damian Osajda

We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex…

Combinatorics · Mathematics 2020-07-14 Agelos Georgakopoulos , Matthias Hamann , Alex Wendland

An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.

Group Theory · Mathematics 2010-06-22 M. J. Dunwoody

We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. We ask whether this is a general property of finitely presented…

Group Theory · Mathematics 2015-04-02 Agelos Georgakopoulos

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…

Geometric Topology · Mathematics 2015-11-03 Yohsuke Watanabe

Let $s$ be a positive integer. Our goal is to find all finite abelian groups $G$ that contain a $2$-subset $A$ for which the undirected Cayley graph $\Gamma(G,A)$ has diameter at most $s$. We provide a complete answer when $G$ is cyclic,…

Combinatorics · Mathematics 2024-12-11 Bela Bajnok , W. Kyle Beatty

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…

Combinatorics · Mathematics 2018-04-13 Grahame Erskine , James Tuite

In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…

Combinatorics · Mathematics 2025-08-01 Ugo Giocanti

This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

Algebraic Topology · Mathematics 2010-05-12 Reinhard Diestel , Philipp Sprüssel

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…

Combinatorics · Mathematics 2024-01-17 Martin Otto

A well-known conjecture of Babai states that if $G$ is any finite simple group and $X$ is a generating set for $G$, then the diameter of the Cayley graph $Cay(G,X)$ is bounded by $\log|G|^c$ for some universal constant $c$. In this paper,…

Group Theory · Mathematics 2022-03-08 Martino Garonzi , Zoltán Halasi , Gábor Somlai

We prove the existence of a limiting distribution for the appropriately rescaled diameters of random undirected Cayley graphs of finite nilpotent groups of bounded rank and nilpotency class, thus extending a result of Shapira and Zuck which…

Combinatorics · Mathematics 2020-02-27 Daniel El-Baz , Carlo Pagano

This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

Combinatorics · Mathematics 2012-07-11 Reinhard Diestel