English
Related papers

Related papers: Cayley Graph Expanders and Groups of Finite Width

200 papers

A graph is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)<k$ for all $v\in V(G)$. We construct a new infinite families of $k$-vertex-critical $(P_5,C_5)$-free graphs for all $k\ge 6$. Our construction generalizes known constructions for…

Combinatorics · Mathematics 2023-06-07 Ben Cameron , Chính T. Hoàng

A finite group $G$ is said to be Cayley integral if every undirected Cayley graph $\operatorname{Cay}(G,S)$ on $G$ is integral. In this paper, we introduce three natural extensions of this concept; namely as: Cayley colour integral,…

Combinatorics · Mathematics 2026-03-24 Sauvik Poddar , Angsuman Das

Groups associated to surfaces isogenous to a higher product of curves can be characterised by a purely group-theoretic condition, which is the existence of a so-called ramification structure. In this paper, we prove that infinitely many…

Group Theory · Mathematics 2021-10-26 Marialaura Noce , Anitha Thillaisundaram

In this contribution we present a construction of large networks of diameter two and of order $\frac{1}{2}d^2$ for every degree $d\geq 8$, based on Cayley graphs with surprisingly simple underlying groups. For several small degrees we…

Combinatorics · Mathematics 2017-04-21 Marcel Abas

In this paper, we describe minimal presentations of maximal pro-$2$ quotients of absolute Galois groups of formally real Pythagorean fields of finite type. For this purpose, we introduce a new class of pro-$2$ groups: $\Delta$-Right Angled…

Group Theory · Mathematics 2025-10-15 Oussama Hamza , Christian Maire , Ján Mináč , Nguyen Duy Tân

Biggs gave an explicit construction, using finite colored trees, of finite permutation groups whose Cayley graphs have valence \(C\) and girth tending to infinity as the radius \(R\) of the tree tends to infinity. We show that when the…

Group Theory · Mathematics 2025-11-25 Christopher H. Cashen

In this paper, a new graph structure called the \textit{coprime order graph} of a finite group $G$ denoted by $\Theta(G)$ has been introduced. The \textit{coprime graph} of a finite group introduced by Ma, Wei, and Yang [\textit{The coprime…

Combinatorics · Mathematics 2021-11-24 Subarsha Banerjee

The purpose of this article is to give a characterization of families of expander graphs via right-angled Artin groups. We prove that a sequence of simplicial graphs $\{\Gamma_i\}_{i\in\mathbb{N}}$ forms a family of expander graphs if and…

Group Theory · Mathematics 2021-10-11 Ramón Flores , Delaram Kahrobaei , Thomas Koberda

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

Combinatorics · Mathematics 2026-05-06 Binbin Li , Jingjian Li , Wei Meng , Hao Yu

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

Group Theory · Mathematics 2026-05-14 Joseph Paul MacManus

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…

Group Theory · Mathematics 2022-07-13 Parveen , Jitender Kumar , Siddharth Singh , Xuanlong Ma

A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…

Combinatorics · Mathematics 2025-04-29 Wei Jin , Pingshan Li , Li Tan

Given a finite covering of graphs $f : Y \to X$, it is not always the case that $H_1(Y;\mathbb{C})$ is spanned by lifts of primitive elements of $\pi_1(X)$. In this paper, we study graphs for which this is not the case, and we give here the…

Geometric Topology · Mathematics 2020-09-01 Destine Lee , Iris Rosenblum-Sellers , Jakwanul Safin , Anda Tenie

For a given graph $G$, the least integer $k\geq 2$ such that for every Abelian group $\mathcal{G}$ of order $k$ there exists a proper edge labeling $f:E(G)\rightarrow \mathcal{G}$ so that $\sum_{x\in N(u)}f(xu)\neq \sum_{x\in N(v)}f(xv)$…

Combinatorics · Mathematics 2023-06-22 Sylwia Cichacz , Jakub Przybyło

This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G is 1. We derive an upper bound of vertex connectivity for the…

Combinatorics · Mathematics 2020-07-08 Sudip Bera , Hiranya Kishore Dey , Sajal Kumar Mukherjee

We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element $w$ in…

Group Theory · Mathematics 2018-03-19 Sean Cleary , Jennifer Taback

We consider latin square graphs $\Gamma = \rm{LSG}(H)$ of the Cayley table of a given finite group $H$. We characterize all pairs $(\Gamma,G)$, where $G$ is a subgroup of autoparatopisms of the Cayley table of $H$ such that $G$ acts…

Combinatorics · Mathematics 2017-09-19 Carmen Amarra

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

Group Theory · Mathematics 2026-05-06 John M. Mackay , Joseph P. MacManus , Davide Spriano

Jord\'an and Tanigawa recently introduced the $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G$. This is a quantitative measure of the $d$-dimensional rigidity of $G$ which generalizes the well-studied notion of spectral…

Combinatorics · Mathematics 2023-04-05 Alan Lew , Eran Nevo , Yuval Peled , Orit E. Raz

This paper considers the degree-diameter problem for undirected circulant graphs. For degrees 10 and 11 newly discovered families of circulant graphs of arbitrary diameter are presented which are largest known and are conjectured to be…

Combinatorics · Mathematics 2018-03-21 Robert R Lewis