Related papers: Babai's conjecture for high-rank classical groups …

For a given graph $G$ of minimum degree at least $k$, let $G_p$ denote the random spanning subgraph of $G$ obtained by retaining each edge independently with probability $p=p(k)$. We prove that if $p \ge \frac{\log k + \log \log k +…

Let $Y(n, p)$ denote the probability space of random 2-dimensional simplicial complexes in the Linial--Meshulam model, and let $Y \sim Y(n, p)$ denote a random complex chosen according to this distribution. In a paper of Cohen, Costa,…

We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.

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

This paper is the second in a series of studies on developing efficient artificial intelligence-based approaches to pathfinding on extremely large graphs (e.g. $10^{70}$ nodes) with a focus on Cayley graphs and mathematical applications.…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…

In this paper, we propose the following conjecture which generalizes a theorem proved by Huang [Hua19] in his recent breakthrough proof of the sensitivity conjecture. We conjecture that for any Cayley graph $X = \Gamma(G,S)$ on a group $G$…

We introduce a method for constructing larger families of connected cospectral graphs from two given cospectral families of sizes $p$ and $q$. The resulting family size depends on the Cartesian primality of the input graphs and can be one…

We prove that if G is SL_2(F) or PSL_2(F), where F is a finite field, and A is a set of generators of G, then either |AAA| > |A|^(1+epsilon), where epsilon is an absolute positive real number, or AAA=G. As a corollary we get that the…

We introduce {\em admissible collections} for a finite group $G$ and use them to prove that most of the finite classical groups in non-defining characteristic satisfy the {\em Quillen dimension at $p$ property}, a strong version of…

Let p be a prime number. It is not known if every finite p-group of rank n>1 can be realized as a Galois group over Q with no more than n ramified primes. We prove that this can be done for the family of finite p-groups which contains all…

A Gallai $k$-colouring of a graph $G$ is a colouring of $E(G)$ with $k$ colours that induces no rainbow triangles, that is, a triangle with edges of 3 different colours. We give a first step towards estimating the number of Gallai…

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

An invariant random subgroup of the countable group {\Gamma} is a random subgroup of {\Gamma} whose distribution is invariant under conjugation by all elements of {\Gamma}. We prove that for a nonamenable invariant random subgroup H, the…

Let $G$ be an undirected graph of order $n$ and let $C_i$ be an $i$-cycle graph. $G$ is called pancyclic if $G$ contains a $C_i$ for any $i\in \{3,4,\ldots,n\}$. We show that the pancyclicity of specific Cayley graphs and the Cartesian…

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

In this paper, we show that every bipartite distance-regular Cayley graph with diameter $3$ can be constructed on the semidirect product of a group and $\mathbb{Z}_{2}$, except possibly for one case.

Let $G$ be a finite group. We show that if $|G| = pqrs$, where $p$, $q$, $r$, and $s$ are distinct odd primes, then every connected Cayley graph on $G$ has a hamiltonian cycle.

Let $G$ be a finite group, and $\alpha$ a nontrivial character of $G$. The McKay graph $\mathcal{M}(G,\alpha)$ has the irreducible characters of $G$ as vertices, with an edge from $\chi_1$ to $\chi_2$ if $\chi_2$ is a constituent of…