English
Related papers

Related papers: Cayley graphs with an infinite Heesch number

200 papers

We prove that for every finitely generated group $\Gamma$, at least one of the following holds: (1) $\Gamma$ has fixed price; (2) each of its Cayley graphs $G$ has infinitely many infinite clusters for some Bernoulli percolation on $G$.

Dynamical Systems · Mathematics 2018-09-10 Russell Lyons

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

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

Group Theory · Mathematics 2019-08-06 Andrea Lucchini

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

Group Theory · Mathematics 2017-01-30 J. Jonušas , J. D. Mitchell

We construct a connected cubic nonnormal Cayley graph on $\mathrm{A}_{2^m-1}$ for each integer $m\geqslant4$ and determine its full automorphism group. This is the first infinite family of connected cubic nonnormal Cayley graphs on…

Combinatorics · Mathematics 2019-06-21 Jiyong Chen , Binzhou Xia , Jin-Xin Zhou

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…

Group Theory · Mathematics 2020-06-15 Scott Harper , Andrea Lucchini

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

General Mathematics · Mathematics 2009-09-29 Linfan Mao , Yanpei Liu

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…

Group Theory · Mathematics 2024-07-10 Eduard Schesler

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

Group Theory · Mathematics 2007-05-23 Miklos Abert , Laszlo Babai

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

Combinatorics · Mathematics 2020-05-26 Joy Morris , Josip Smolcic

Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.

Group Theory · Mathematics 2016-10-18 J. Awang , M. Pfeiffer , N. Ruskuc

We show that an infinite finitely generated group G is virtually-Z if and only if every Cayley graph of G contains only finitely many Busemann points in its horofunction boundary. This complements a previous result of the second named…

Group Theory · Mathematics 2023-05-04 Liran Ron-George , Ariel Yadin

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

Combinatorics · Mathematics 2021-11-11 Peter J. Cameron , R. Raveendra Prathap , T. Tamizh Chelvam

A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code $C$ in $\Gamma$ is a set of vertices of $\Gamma$ such…

Combinatorics · Mathematics 2022-10-10 Jun-Yang Zhang

Given a finite Abelian group $G$ and a generator subset $A\subset G$ of cardinality two, we consider the Cayley digraph $\Gamma=$Cay$(G,A)$. This digraph is called $2$--Cayley digraph. An extension of $\Gamma$ is a $2$--Cayley digraph,…

Combinatorics · Mathematics 2015-05-25 F. Aguiló , A. Miralles , M. Zaragozá

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 show that any connected Cayley graph $\Gamma$ on an Abelian group of order $2n$ and degree $\tilde{\Omega}(\log n)$ has at most $2^{n+1}(1 + o(1))$ independent sets. This bound is tight up to to the $o(1)$ term when $\Gamma$ is…

Combinatorics · Mathematics 2021-12-06 Aditya Potukuchi , Liana Yepremyan

A total perfect code in a graph $\Gamma$ is a subset $C$ of $V(\Gamma)$ such that every vertex of $\Gamma$ is adjacent to exactly one vertex in $C$. We give necessary and sufficient conditions for a conjugation-closed subset of a group to…

Combinatorics · Mathematics 2018-04-10 Sanming Zhou

All Cayley representations of the distant graph $\Gamma _Z$ over integers are characterized as Neumann subgroups of the extended modular group. Possible structures of Neumann subgroups are revealed and it is shown that every such a…

Group Theory · Mathematics 2020-10-20 Andrzej Matraś , Artur Siemaszko

Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b) has a hamiltonian path. This implies there is a hamiltonian path in every connected Cayley…

Combinatorics · Mathematics 2011-07-04 Dave Witte Morris