On transitive permutation groups with exponential graph growth
Combinatorics
2025-08-19 v1 Group Theory
Abstract
Let be a finite connected graph and a vertex-transitive group of its automorphisms. The pair is said to be locally- if the permutation group induced by the action of the vertex-stabiliser on the set of neighbours of a vertex in is permutation isomorphic to . The maximum growth of as a function of for locally- pairs is called the graph growth of . We prove that if is a transitive permutation group on a set admitting a nontrivial block such that the pointwise stabiliser of in is nontrivial, then the graph growth of is exponential. This generalises several results in the literature on transitive permutation groups with exponential graph growth.
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}
}