On the generalised Saxl graphs of permutation groups
Algebraic Combinatorics · 01.07.2026 · 9 (3) · 611-648
DOI: 10.5802/alco.493 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebraic Combinatorics, online erschienen am 01.07.2026. Verfasst von Saul D. Freedman und 3 weiteren Autor:innen. Die Arbeit nennt 50 Literaturangaben.
Abstract (Originalsprache)
A base for a finite permutation group G ⩽ Sym ( Ω ) is a subset of Ω with trivial pointwise stabiliser in G , and the base size of G is the smallest size of a base for G . Motivated by the interest in groups of base size two, Burness and Giudici introduced the notion of the Saxl graph. This graph has vertex set Ω , with edges between elements if they form a base for G . We define a generalisation of this graph that encodes useful information about G whenever b ( G ) ⩾ 2 : here, the edges are the pairs of elements of Ω that can be extended to bases of size b ( G ) . In particular, for primitive groups, we investigate the completeness and arc-transitivity of the generalised graph, and the generalisation of Burness and Giudici’s Common Neighbour Conjecture on the original Saxl graph.
Zitieren
APA
Freedman, S. D., Huang, H. Y., Lee, M., & Rekvényi, K. (2026). On the generalised Saxl graphs of permutation groups. Algebraic Combinatorics, 9(3), 611-648. https://doi.org/10.5802/alco.493
Vancouver
Freedman SD, Huang HY, Lee M, Rekvényi K. On the generalised Saxl graphs of permutation groups. Algebraic Combinatorics. 2026;9(3):611-648. doi:10.5802/alco.493
BibTeX
@article{Freedman2026,
author = {Freedman, Saul D. and Huang, Hong Yi and Lee, Melissa and Rekvényi, Kamilla},
title = {On the generalised Saxl graphs of permutation groups},
journal = {Algebraic Combinatorics},
year = {2026},
volume = {9},
number = {3},
pages = {611--648},
doi = {10.5802/alco.493}
}
EUVIMED