Related papers: Logarithmic girth expander graphs of $SL_n(\mathbb…

We study $2$-dimensional Artin groups of hyperbolic type from the viewpoint of measure equivalence, and establish rigidity theorems. We first prove that they are boundary amenable. So is every group acting discretely by simplicial…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

Given a finite Abelian group $G$ and a generator subset $A\subset G$ of cardinality two, we consider the Cayley digraph $\Gamma=$Cay$(G,A)$. This digraph is called $2$--Cayley digraph. An extension of $\Gamma$ is a $2$--Cayley digraph,…

The symplectic graph Sp(2d, q) is the collinearity graph of the symplectic space of dimension 2d over a finite field of order q. A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1, lambda_2 ,m,n) if…

Suppose G is a finite group, such that |G| = 27p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erd\H{o}s, Faudree, Rousseau and Schelp in 1978. Research has mainly focused on the size-Ramsey numbers of $n$-vertex graphs…

Hypergraph expanders are hypergraphs with surprising, non-intuitive expansion properties. In a recent paper, the first author gave a simple construction, which can be randomized, of $3$-uniform hypergraph expanders with polylogarithmic…

Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…

The Shannon capacity of a graph is a fundamental quantity in zero-error information theory measuring the rate of growth of independent sets in graph powers. Despite being well-studied, this quantity continues to hold several mysteries.…

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…

The $SL(2,\mathbb{Z})$-orbits of primitive $n$-squared origamis can be represented by finite four-regular graphs. It is a conjecture of McMullen that the orbit graphs of such origamis in the stratum $\mathcal{H}(2)$ form an expander family.…

Let $S\subset \text{SL}_2(\mathbb Z)\times \text{SL}_2(\mathbb Z)$ or $\text{SL}_2(\mathbb Z)\ltimes \mathbb Z^2$ be finite symmetric and assume $S$ generates a group $G$ which is a Zariski-dense subgroup $\text{SL}_2(\mathbb Z)\times…

Let $n$ be a positive integer. For each $0\leq j \leq n-1$ we let $C_n^{j}$ denote Cayley graph for the cyclic group ${\mathbb Z}_n $ with respect to the subset $\{1, j\}$. For any such pair $(n,j)$ we compute the size of the Grothendieck…

For any positive integer $k$, let $\mathcal{G}_k$ denote the set of finite groups $G$ such that all Cayley graphs ${\rm Cay}(G,S)$ are integral whenever $|S|\le k$. Est${\rm \acute{e}}$lyi and Kov${\rm \acute{a}}$cs \cite{EK14} classified…

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

An infinite family of bounded-degree 'unique-neighbor' expanders was constructed explicitly by Alon and Capalbo (2002). We present an infinite family F of bounded-degree unique-neighbor expanders with the additional property that every…

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…

In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it…

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…