English
Related papers

Related papers: Relative Hyperbolicity of Graphical Small Cancella…

200 papers

We extend fundamental results of small cancellation theory to groups whose presentations satisfy the generalizations of the classical C(6) and C(7) conditions in graphical small cancellation theory. Using these graphical small cancellation…

Group Theory · Mathematics 2014-07-25 Dominik Gruber

Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…

Operator Algebras · Mathematics 2025-12-23 Swarnendu Datta , Debashish Goswami , Soumalya Joardar

The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…

Combinatorics · Mathematics 2015-10-14 Mohammad Farrokhi Derakhshandeh Ghouchan , Mehdi Rajabian , Ahmad Erfanian

Let $G$ be a finite abelian group written additively with identity $0$, and $\Omega$ be an inverse closed generating subset of $G$ such that $0\notin \Omega$. We say that $ \Omega $ has the property \lq\lq{}$us$\rq\rq{} (unique summation),…

Group Theory · Mathematics 2021-05-13 S. Morteza Mirafzal

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

Metric Geometry · Mathematics 2019-11-26 Mikael de la Salle , Romain Tessera

It was proved by Mineyev and Yaman that, if $(\Gamma, \Gamma')$ is a relatively hyperbolic pair, the comparison map $$ H_b^k(\Gamma, \Gamma'; V) \to H^k(\Gamma, \Gamma'; V) $$ is surjective for every $k \ge 2$, and any bounded…

Group Theory · Mathematics 2016-11-08 Federico Franceschini

We explain and generalise a construction due to Gromov to realise geometric small cancellation groups over graphs of groups as fundamental groups of non-positively curved 2-dimensional complexes of groups. We then give conditions so that…

Group Theory · Mathematics 2014-02-07 Alexandre Martin

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

Combinatorics · Mathematics 2025-08-06 Alireza Abdollahi , Majid Arezoomand , Tao Feng , Shixin Wang

We leverage a correspondence between group actions and edge-labelled graphs in two ways. First, we give a unified presentation of several folklore results connecting weak containment, local-global convergence, and continuous model theory.…

Combinatorics · Mathematics 2024-10-24 Riley Thornton

Let $\Gamma=(V,E)$ be a graph. If all the eigenvalues of the adjacency matrix of the graph $\Gamma$ are integers, then we say that $\Gamma$ is an integral graph. A graph $\Gamma$ is determined by its spectrum if every graph cospectral to it…

Combinatorics · Mathematics 2021-01-22 Jia-Bao Liu , S. Morteza Mirafzal , Ali Zafari

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…

Combinatorics · Mathematics 2016-07-12 Yan-Quan Feng , Klavdija Kutnar , Dragan Marusic , Da-Wei Yang

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

Group Theory · Mathematics 2024-11-27 Timo Velten

Let $\Gamma$ be a finite connected $G$-vertex-transitive graph and let $v$ be a vertex of $\Gamma$. If the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$ is permutation isomorphic to…

Combinatorics · Mathematics 2012-11-15 Pablo Spiga , Gabriel Verret

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 end compactification |\Gamma| of the locally finite graph \Gamma is the union of the graph and its ends, endowed with a suitable topology. We show that \pi_1(|\Gamma|) embeds into a nonstandard free group with hyperfinitely many…

Geometric Topology · Mathematics 2012-03-30 Isaac Goldbring , Alessandro Sisto

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

Combinatorics · Mathematics 2012-11-27 Francesco G. Russo

We work in the density model of random groups. We prove that they satisfy an isoperimetric inequality with sharp constant $1-2d$ depending upon the density parameter $d$. This implies in particular a property generalizing the ordinary $C'$…

Group Theory · Mathematics 2007-05-23 Yann Ollivier

We show that a group that is hyperbolic relative to strongly shortcut groups is itself strongly shortcut, thus obtaining new examples of strongly shortcut groups. The proof relies on a result of independent interest: we show that every…

Group Theory · Mathematics 2023-10-24 Nima Hoda , Suraj Krishna M S

For a graph $\Gamma$, the multiplicity of the eigenvalue $0$, denoted by $\eta(\Gamma)$, is called the nullity of $\Gamma$. Also the energy of $\Gamma$, denoted by $\mathcal{E}(\Gamma)$, is defined as the sum of the absolute values of the…

Combinatorics · Mathematics 2024-10-24 Mahdi Ebrahimi

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

Combinatorics · Mathematics 2026-05-11 Jasmin Katz , Xiaopan Lian , Alexandru Malekshahian , Andrey Shapiro