English

On Valency Problems of Saxl Graphs

Group Theory 2021-10-15 v3 Combinatorics

Abstract

Let GG be a permutation group on a set Ω\Omega and recall that a base for GG is a subset of Ω\Omega such that its pointwise stabiliser is trivial. In a recent paper, Burness and Giudici introduced the Saxl graph of GG, denoted Σ(G)\Sigma(G), with vertex set Ω\Omega and two vertices adjacent if they form a base. If GG is transitive, then Σ(G)\Sigma(G) is vertex-transitive and it is natural to consider its valency (which we refer to as the valency of GG). In this paper we present a general method for computing the valency of any finite transitive group and we use it to calculate the exact valency of every primitive group with stabiliser a Frobenius group with cyclic kernel. As an application, we calculate the valency of every almost simple primitive group with an alternating socle and soluble stabiliser and we use this to extend results of Burness and Giudici on almost simple primitive groups with prime-power or odd valency.

Keywords

Cite

@article{arxiv.2012.13747,
  title  = {On Valency Problems of Saxl Graphs},
  author = {Jiyong Chen and Hong Yi Huang},
  journal= {arXiv preprint arXiv:2012.13747},
  year   = {2021}
}
R2 v1 2026-06-23T21:26:12.122Z