On the Saxl graphs of primitive groups with soluble stabilisers

Tim Burness*, Hong Yi Huang*

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)peer-review

4 Citations (Scopus)
19 Downloads (Pure)

Abstract

t. Let G be a transitive permutation group on a finite set Ω and recall that a
base for G is a subset of Ω with trivial pointwise stabiliser. The base size of G, denoted b(G), is the minimal size of a base. If b(G) = 2 then we can study the Saxl graph Σ(G) of G, which has vertex set Ω and two vertices are adjacent if and only if they form a base. This is a vertex-transitive graph, which is conjectured to be connected with diameter at most 2 when G is primitive. In this paper, we combine probabilistic and computational methods to prove a strong form of this conjecture for all almost simple primitive groups with soluble point stabilisers. In this setting, we also establish best possible lower bounds on the clique and independence numbers of Σ(G) and we determine the groups with a unique regular suborbit, which can be interpreted in terms of the valency of Σ(G).
Original languageEnglish
Pages (from-to)1053-1087
Number of pages35
JournalAlgebraic Combinatorics
Volume5
Issue number5
Early online date9 Nov 2022
DOIs
Publication statusE-pub ahead of print - 9 Nov 2022

Bibliographical note

Funding Information:
Acknowledgements. Both authors thank Eamonn O’Brien for his assistance with several computations in this paper. The second author thanks the China Scholarship Council for supporting his doctoral studies at the University of Bristol and he thanks the Southern University of Science and Technology (SUSTech) for their generous hospitality during a visit in 2021.

Publisher Copyright:
© The author(s), 2022.

Fingerprint

Dive into the research topics of 'On the Saxl graphs of primitive groups with soluble stabilisers'. Together they form a unique fingerprint.

Cite this