Related papers: Groups that produce expander graphs

We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.

Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with…

Schreier graphs, which possess both a graph structure and a Schreier structure (an edge-labeling by the generators of a group), are objects of fundamental importance in group theory and geometry. We study the Schreier structures with which…

Using the construction of a nonorientable Curtis-Tits group of type $\tilde A_n$, we obtain new explicit families of expander graphs of valency five for unitary groups over finite fields.

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

We study the isoperimetric and spectral profiles of certain families of finitely generated groups defined via actions on labelled Schreier graphs and simple {\em gluing} of such. In one of our simplest constructions---the {\em…

Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a class of Toeplitz graphs, and will be denoted by…

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

We define two different weakenings of coarse amenability (also known as Yu's property A), namely fibred coarse amenability and coarse amenability at infinity. These two properties allow us to prove that a residually finite group is coarsely…

Let the group $G$ act transitively on the finite set $\Omega$, and let $S \subseteq G$ be closed under taking inverses. The Schreier graph $Sch(G \circlearrowleft \Omega,S)$ is the graph with vertex set $\Omega$ and edge set $\{…

In 1988, Duval introduced the concept of directed strongly regular graphs, which can be viewed as a directed graph version of strongly regular graphs. Such directed graphs have similar structural and algebraic properties to strongly regular…

We prove that for any countable acylidrically hyperbolic group $G$, there exists a generating set $S$ of $G$ such that the corresponding Cayley graph $\Gamma(G,S)$ is hyperbolic, $|\partial\Gamma(G,X)|>2$, the natural action of $G$ on…

We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…

Let $G$ be a finitely generated group, $\mathrm{Sub}(G)$ the (compact, metric) space of all subgroups of $G$ with the Chaubuty topology and $X!$ the (Polish) group of all permutations of a countable set $X$. We show that the following…

We define the Cayley graph and its growth function for multivalued groups. We prove that if we change a finite set of generators of multivalued group, or change the starting point, we get an equivalent growth function. We prove that if we…

We construct a family of finite special 2-groups which have commuting graph of increasing diameter

We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…

In this paper, we will study the chromatic number of Cayley graphs of algebraic groups that arise from algebraic constructions. Using Lang-Weil bound and representation theory of finite simple groups of Lie type, we will establish lower…

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…