Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
Cheryl E. Praeger, Pablo Spiga, Gabriel Verret

TL;DR
This paper develops a method to bound the size of vertex stabilizers in finite vertex-transitive graphs, reducing the problem to cases involving nonabelian simple groups and applying to locally primitive/quasiprimitive graphs.
Contribution
It introduces a reduction technique for bounding vertex stabilizer sizes in G-vertex-transitive graphs, focusing on cases where G is quasiprimitive or biquasiprimitive, and applies normal quotient methods.
Findings
Bound on vertex stabilizer size in G-vertex-transitive graphs.
Reduction to nonabelian simple group cases.
Application to G-locally primitive/quasiprimitive graphs.
Abstract
In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a -vertex-transitive graph . In the main result the group is quasiprimitive or biquasiprimitive on the vertices of , and we obtain a genuine reduction to the case where is a nonabelian simple group. Using normal quotient techniques developed by the first author, the main theorem applies to general -vertex-transitive graphs which are -locally primitive (respectively, -locally quasiprimitive), that is, the stabiliser of a vertex acts primitively (respectively quasiprimitively) on the set of vertices adjacent to . We discuss how our results may be used to investigate conjectures by Richard Weiss (in 1978) and the first author (in 1998) that the order of is bounded above by some function depending only on the valency of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Finite Group Theory Research · Limits and Structures in Graph Theory
