On transitive permutation groups with exponential graph growth

TL;DR

This paper proves that certain transitive permutation groups with a specific block structure exhibit exponential growth in the size of their vertex stabilizers relative to the graph size, generalizing previous results.

Contribution

It establishes that transitive permutation groups with a nontrivial block and nontrivial pointwise stabilizer have exponential graph growth, extending earlier findings.

Findings

Groups with a nontrivial block and stabilizer have exponential growth

Generalizes previous results on transitive permutation groups

Provides conditions for exponential graph growth in vertex-transitive automorphism groups

Abstract

Let $\Gamma$ be a finite connected graph and $G$ a vertex-transitive group of its automorphisms. The pair $(\Gamma, G)$ is said to be locally-$L$ if the permutation group induced by the action of the vertex-stabiliser $G_v$ on the set of neighbours of a vertex $v$ in $\Gamma$ is permutation isomorphic to $L$. The maximum growth of $|G_v|$ as a function of $|V\Gamma|$ for locally-$L$ pairs $(\Gamma,G)$ is called the graph growth of $L$. We prove that if $L$ is a transitive permutation group on a set $\Omega$ admitting a nontrivial block $B$ such that the pointwise stabiliser of $\Omega\setminus B$ in $L$ is nontrivial, then the graph growth of $L$ is exponential. This generalises several results in the literature on transitive permutation groups with exponential graph growth.