English
Related papers

Related papers: Expansion in Cayley graphs, Cayley sum graphs and …

200 papers

Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…

Combinatorics · Mathematics 2023-11-15 Xueyi Huang , Lu Lu , Xiongfeng Zhan

Isomorphic factorizations of complete graphs originate from the seminal work of Frank Harary and collaborators, who initiated the systematic study of decompositions of complete graphs into pairwise isomorphic spanning subgraphs. In this…

Combinatorics · Mathematics 2026-03-09 Huye Chen , Jingjian Li , Hao Yu , Zitong Yu

We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order $p^2q^2$, where $p$ and $q$ are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main…

Combinatorics · Mathematics 2026-03-11 Iqbal Atmaja , Yeni Susanti , Ahmad Erfanian

Let $p$ be an odd prime, and $D_{2p}=\langle \tau,\sigma\mid \tau^p=\sigma^2=e,\sigma\tau\sigma=\tau^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we provide the number of (connected) Cayley (di-)graphs on $D_{2p}$ up to…

Combinatorics · Mathematics 2016-12-13 Xueyi Huang , Qiongxiang Huang

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

Group Theory · Mathematics 2011-04-11 László Pyber , Endre Szabó

Let $\Omega$ be a finite symmetric subset of GL$_n(\mathbb{Z}[1/q_0])$, and $\Gamma:=\langle \Omega \rangle$. Then the family of Cayley graphs $\{{\rm Cay}(\pi_m(\Gamma),\pi_m(\Omega))\}_m$ is a family of expanders as $m$ ranges over fixed…

Group Theory · Mathematics 2018-02-13 Alireza Salehi Golsefidy

We survey the known group properties that a sequence of finite groups or group actions needs to satisfy to admit subsets of bounded cardinality producing expander Cayley or Schreier graphs. We prove that an infinite amenable group and…

Group Theory · Mathematics 2025-11-21 Luca Sabatini

We construct an infinite family of bounded-degree bipartite unique-neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may…

Combinatorics · Mathematics 2023-01-10 Ron Asherov , Irit Dinur

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…

Combinatorics · Mathematics 2021-01-13 Federico Vigolo

We show that pairs of generators for the family Sz(q) of Suzuki groups may be selected so that the corresponding Cayley graphs are expanders. By combining this with several deep works of Kassabov, Lubotzky and Nikolov, this establishes that…

Group Theory · Mathematics 2010-05-06 Emmanuel Breuillard , Ben Green , Terence Tao

We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.

Group Theory · Mathematics 2019-01-30 Jakob Schneider

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel…

Combinatorics · Mathematics 2016-03-29 Jing Chen , Binzhou Xia

In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous…

Group Theory · Mathematics 2023-10-04 Rachael Boyd , Ruth Charney , Rose Morris-Wright , Sarah Rees

We study the diameter of LPS Ramanujan graphs $X_{p,q}$. We show that the diameter of the bipartite Ramanujan graphs is greater than $ (4/3)\log_{p}(n) +O(1)$ where $n$ is the number of vertices of $X_{p,q}$. We also construct an infinite…

Number Theory · Mathematics 2017-03-28 Naser T Sardari

We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the…

Probability · Mathematics 2011-09-20 Russell Lyons , Fedor Nazarov

The purpose of this paper is to study spectral properties of a family of Cayley graphs on finite commutative rings. Let $R$ be such a ring and $R^\times$ its set of units. Let $Q_R=\{u^2: u\in R^\times\}$ and $T_R=Q_R\cup(-Q_R)$. We define…

Combinatorics · Mathematics 2015-04-14 Xiaogang Liu , Sanming Zhou

In this work we consider the class of Cayley graphs known as generalized Paley graphs (GP-graphs for short) given by $\Gamma(k,q) = Cay(\mathbb{F}_q, \{x^k : x\in \mathbb{F}_q^* \})$, where $\mathbb{F}_q$ is a finite field with $q$…

Combinatorics · Mathematics 2025-04-03 Ricardo A. Podestá , Denis E. Videla

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

Combinatorics · Mathematics 2012-03-06 Soumya Bhoumik , Edward Dobson , Joy Morris

We show that the cop number of the Cayley sum graph of a finite group $G$ with respect to a symmetric subset $S$ is at most twice its degree when the graph is connected, undirected. We also prove that a similar bound holds for the cop…

Combinatorics · Mathematics 2025-04-29 Arindam Biswas , Jyoti Prakash Saha
‹ Prev 1 4 5 6 7 8 10 Next ›