English

On transitive permutation groups with exponential graph growth

Combinatorics 2025-08-19 v1 Group Theory

Abstract

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

Keywords

Cite

@article{arxiv.2508.12588,
  title  = {On transitive permutation groups with exponential graph growth},
  author = {Đorđe Mitrović and Gabriel Verret},
  journal= {arXiv preprint arXiv:2508.12588},
  year   = {2025}
}
R2 v1 2026-07-01T04:54:09.600Z