Related papers: Fit systolic groups, exactly

In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the…

We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of…

Suppose that $F$ is a finite field and $R=M_n(F)$ is the ring of $n$-square matrices over $F$. Here we characterize when the Cayley graph of the additive group of $R$ with respect to the set of invertible elements of $R$, called the unitary…

We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…

A characterization is completed for finite groups acting arc-transitively on maps with square-free Euler characteristic, associated with infinite families of regular maps of square-free Euler characteristic presented. This is based on a…

An amply regular graph is a regular graph such that any two adjacent vertices have $\alpha$ common neighbors and any two vertices with distance $2$ have $\beta$ common neighbors. We prove a sharp lower bound estimate for the Lin--Lu--Yau…

We expand the class of groups with relatively geometric actions on CAT(0) cube complexes by proving that it is closed under $C'(\frac16)$--small cancellation free products. We build upon a result of Martin and Steenbock who prove an…

In this paper we show that if a discrete group $G$ acts properly isometrically on a discrete space $X$ for which the uniform Roe algebra $C_u^*(X)$ is exact then $G$ is an exact group. As a corollary, we note that if the action is cocompact…

In this note we prove that every finitely presented subgroup of a systolic group is itself systolic.

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

We show that a $k$-stable set in a finite group can be approximated, up to given error $\epsilon>0$, by left cosets of a subgroup of index $\epsilon^{\text{-}O_k(1)}$. This improves the bound in a similar result of Terry and Wolf on stable…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

We prove that, given a torsion-free relatively hyperbolic group G with non-relatively-hyperbolic peripherals, isomorphic finite index subgroups of G have the same index. This applies for instance to fundamental groups of finite-volume…

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

We prove that curve complexes of surfaces are finitely rigid: for every orientable surface S of finite topological type, we identify a finite subcomplex X of the curve complex C(S) such that every locally injective simplicial map from X…

We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

Given a set system $\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$, where $\mathcal{U}$ is a set of elements and $\mathcal{S}$ is a set of subsets of $\mathcal{U}$, an exact hitting set $\mathcal{U}'$ is a subset of $\mathcal{U}$ such that each…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

Let $\mathcal{C}$ be a class of graphs closed under taking induced subgraphs. We say that $\mathcal{C}$ has the {\em clique-stable set separation property} if there exists $c \in \mathbb{N}$ such that for every graph $G \in \mathcal{C}$…