Related papers: Rough ends of infinite primitive groups

Let $\Gamma_g$ denote the orientation-preserving Mapping Class Group of the genus $g\geq 1$ closed orientable surface. In this paper we show that for fixed $g$, every finite group occurs as a quotient of a finite index subgroup of…

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

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…

Let $G$ be an infinite simple group of finite Morley rank and $\alpha$ a supertight automorphism of $G$ so that the fixed point subgroup $P_n:=C_G(\alpha^n)$ is pseudofinite for all $n\in \mathbb{N}\setminus\{0\}$. It is know (using CFSG)…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

A base for a subgroup $G$ of $\mathrm{Sym}(\Omega)$ is a sequence of elements of $\Omega$ with trivial pointwise stabiliser. The size of the smallest base for $G$ is denoted $b(G)$. There is a natural greedy algorithm to compute a base for…

For a transitive infinite connected graph $G$, let $\mu(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of…

Let $G$ be a finite non-regular primitive permutation group on a set $\Omega$ with point stabiliser $G_{\alpha}$. Then $G$ is said to be extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus…

For a finite group $G,$ we investigate the direct graph $\Gamma(G),$ whose vertices are the non-hypercentral elements of $G$ and where there is an edge $x\mapsto y$ if and only if $[x,_ny]=1$ for some $n \in \mathbb N.$ We prove that…

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Let $A$ be a finite group acting by automorphisms on the finite group $G$. We introduce the commuting graph $\Gamma (G,A)$ of this action and study some questions related to the structure of $G$ under certain graph theoretical conditions on…

For a finite group $G$ the co-prime graph $\Gamma(G)$ is defined as a graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $gcd(o(x),o(y))=1$ where $o(x)$ and $o(y)$ denote the orders of the…

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite permutation group and recall that the base size of $G$ is the minimal size of a subset of $\Omega$ with trivial pointwise stabiliser. There is an extensive literature on base sizes for…

Let $\Gamma(S)$ be the pure mapping class group of a connected orientable surface $S$ of negative Euler characteristic. For ${\mathscr C}$ a class of finite groups, let $\hat{\pi}_1(S)^{\mathscr C}$ be the pro-${\mathscr C}$ completion of…

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

We study properties of automorphisms of graph products of groups. We show that graph product $\Gamma\mathcal{G}$ has non-trivial pointwise inner automorphisms if and only if some vertex group corresponding to a central vertex has…

Let $(\mathcal{G},\Gamma)$ be an abstract graph of finite groups. If $\Gamma$ is finite, we can construct a profinite graph of groups in a natural way $(\hat{\mathcal{G}},\Gamma)$, where $\hat{\mathcal{G}}(m)$ is the profinite completion of…

Let $G_\Gamma\curvearrowright X$ and $G_\Lambda\curvearrowright Y$ be two free measure-preserving actions of one-ended right-angled Artin groups with trivial center on standard probability spaces. Assume they are irreducible, i.e. every…

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…