English
Related papers

Related papers: On groups with unbounded Cayley graphs

200 papers

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

Differential Geometry · Mathematics 2007-05-23 Nader Yeganefar

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

In this work we characterise Cayley graphs of Coxeter groups with respect to the standard generating set that admit uncountable vertex stabilisers. As a corollary, we fully identify finitely generated Coxeter groups for which the…

Group Theory · Mathematics 2023-02-10 Federico Berlai , Michal Ferov

Let Ga be a subgroup of GL_d(Q) generated by a finite symmetric set S. For an integer q, denote by Ga_q the subgroup of Ga consisting of the elements that project to the unit element mod q. We prove that the Cayley graphs of Ga/Ga_q with…

Group Theory · Mathematics 2013-01-28 Alireza Salehi Golsefidy , Péter P. Varjú

Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…

Combinatorics · Mathematics 2025-01-20 John Haslegrave

Let $G$ be a finite group. We show that if $|G| = pqrs$, where $p$, $q$, $r$, and $s$ are distinct odd primes, then every connected Cayley graph on $G$ has a hamiltonian cycle.

Combinatorics · Mathematics 2021-08-02 Dave Witte Morris

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

The aim of this small note is to prove an elementary yet useful properties of finitely presented groups. Let G be a finitely generated group with one end. Fix a (finite) generating set and let $B_n$ be the ball of radius $n$ around $e$. Let…

Group Theory · Mathematics 2014-08-13 Antoine Gournay

Suppose G is a finite group, such that |G| = 27p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Combinatorics · Mathematics 2011-04-22 Ebrahim Ghaderpour , Dave Witte Morris

Let G be a finitely generated group and Cay(G, S) be the Cayley graph of G with respect to a finite generating set S. We characterize the Gromov hyperbolicity of G in terms of the genericity of contracting elements in Cay(G, S).

Geometric Topology · Mathematics 2023-08-04 Kunal Chawla , Inhyeok Choi , Giulio Tiozzo

Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…

Group Theory · Mathematics 2021-08-31 Andrea Lucchini , Daniele Nemmi

It is known, that the existence of dead ends (of arbitrary depth) in the Cayley graph of a group depends on the chosen set of generators. Nevertheless there exist many groups, which do not have dead ends of arbitrary depth with respect to…

Group Theory · Mathematics 2007-05-23 Jörg Lehnert

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

Group Theory · Mathematics 2019-03-25 Martin W. Liebeck , Aner Shalev

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…

Group Theory · Mathematics 2012-05-09 John Bamberg , Nick Gill , Thomas Hayes , Harald Helfgott , Ákos Seress , Pablo Spiga

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

Group Theory · Mathematics 2007-05-23 Vladimir Tolstykh

For a transitive infinite connected graph $G$, let $\mu(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of…

Probability · Mathematics 2014-10-10 He Song , Kai-Nan Xiang , Song-Chao-Hao Zhu

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

Combinatorics · Mathematics 2007-11-21 Jacob Steinhardt

We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…

Combinatorics · Mathematics 2025-10-23 Sandra Albrechtsen , Matthias Hamann

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

Combinatorics · Mathematics 2015-05-05 Alireza Abdollahi , Shahrooz Janbaz , Mojtaba Jazaeri

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash