On transitive permutation groups with exponential graph growth
Abstract
Let be a finite connected graph and G a vertex-transitive group of its automorphisms. The pair (, G) is said to be locally-L if the permutation group induced by the action of the vertex-stabiliser Gv on the set of neighbours of a vertex v in is permutation isomorphic to L. The maximum growth of |Gv| as a function of |V| for locally-L pairs (,G) is called the graph growth of L. We prove that if L is a transitive permutation group on a set admitting a nontrivial block B such that the pointwise stabiliser of 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.