Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-25T05:21:19.976Z Has data issue: false hasContentIssue false

VERTEX-PRIMITIVE s-ARC-TRANSITIVE DIGRAPHS OF ALMOST SIMPLE GROUPS

Published online by Cambridge University Press:  16 October 2024

LEI CHEN*
Affiliation:
Department of Mathematics and Statistics, University of Western Australia, Perth, Western Australia 6009, Australia
Rights & Permissions [Opens in a new window]

Abstract

Type
PhD Abstract
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.

The investigation of s-arc-transitivity can be dated back to 1947. Tutte [Reference Tutte7] studied cubic graphs and showed that a cubic graph can be at most $5$ -arc-transitive. A more general result for s-arc-transitivity of graphs was obtained by Weiss [Reference Weiss8] and it turns out that finite undirected graphs of valency at least $3$ that are not cycles can be at most $7$ -arc-transitive. In stark contrast with the situation in undirected graphs, Praeger [Reference Praeger6] showed that for each s and d, there are infinitely many finite s-arc-transitive digraphs of valency d that are not $(s+1)$ -arc-transitive.

However, once we add the condition of primitivity, the situation is quite different. Given the lack of evidence of the existence of vertex-primitive $2$ -arc-transitive digraphs, Praeger [Reference Praeger6] asked if there exists any vertex-primitive $2$ -arc-transitive digraph. This question was answered in [Reference Giudici, Li and Xia2, Reference Giudici and Xia4] by constructing infinite families of G-vertex-primitive $(G,2)$ -arc-transitive digraphs such that G has AS and SD type, respectively. In [Reference Giudici and Xia4], Giudici and Xia then asked for the upper bound on s for a G-vertex-primitive $(G,s)$ -arc-transitive digraph that is not a directed cycle. A reasonable conjecture is that $s\leqslant 2$ . At the same time, Giudici and Xia [Reference Giudici and Xia4] showed that to answer that question, it suffices for us to consider the case when G is almost simple.

Various attempts have been made to analyse the s-arc-transitivity of different almost simple groups. For instance, Giudici et al. [Reference Giudici, Li and Xia3] showed that $s\leqslant 2$ when the socle of G is a projective special linear group, Pan et al. [Reference Pan, Wu and Yin5] proved that $s\leqslant 2$ when the socle of G is an alternating group except for one subcase and Chen et al. [Reference Chen, Giudici and Praeger1] addressed the case when the socle of G is a Suzuki group or a small Ree group, when it turns out that the upper bound on s is $1$ . The result from [Reference Chen, Giudici and Praeger1] is part of Chapter 4.

In this thesis, we investigate the upper bound on s for G-vertex-primitive $(G,s)$ -arc-transitive digraphs for almost simple groups G with $\mathrm {Soc}(G)=\mathrm {PSp}_{2n}(q)'$ , $\mathrm {PSU}_{n}(q)$ (for certain cases), $\mathrm {Sz}(q)$ , $\mathrm {Ree}(q)$ , ${}^{2}\mathrm {F}_{4}(q)$ , ${}^{3}\mathrm {D}_{4}(q)$ and $\mathrm {G}_{2}(q)$ . It turns out that such an upper bound is $s\leqslant 2$ for all the groups mentioned above, giving some evidence to the conjecture that $s\leqslant 2$ .

Footnotes

Thesis submitted to the University of Western Australia in November 2023; degree approved on 15 March 2024: supervisors Michael Giudici and Cheryl Praeger.

References

Chen, L., Giudici, M. and Praeger, C. E., ‘Vertex-primitive s-arc-transitive digraphs admitting a Suzuki or Ree group’, European J. Combin. 112 (2023), Article no. 103729.CrossRefGoogle Scholar
Giudici, M., Li, C. H. and Xia, B., ‘An infinite family of vertex-primitive $2$ -arc-transitive digraphs’, J. Combin. Theory Ser. B 127 (2017), 113.CrossRefGoogle Scholar
Giudici, M., Li, C. H. and Xia, B., ‘Vertex-primitive $s$ -arc-transitive digraphs of linear groups’, J. Math. Pures Appl. (9) 223 (2019), 54555483.Google Scholar
Giudici, M. and Xia, B., ‘Vertex-quasiprimitive $2$ -arc-transitive digraphs’, Ars Math. Contemp. 14(1) (2018), 6782.CrossRefGoogle Scholar
Pan, J., Wu, C. and Yin, F., ‘Vertex-primitive $s$ -arc-transitive digraphs of alternating and symmetric groups’, J. Algebra 544 (2020), 7581.CrossRefGoogle Scholar
Praeger, C. E., ‘Highly arc-transitive digraphs’, European J. Combin. 10(3) (1989), 281292.CrossRefGoogle Scholar
Tutte, W. T., ‘A family of cubical graphs’, Proc. Cambridge Philos. Soc. 43 (1947), 459474.CrossRefGoogle Scholar
Weiss, R., ‘The non-existence of 8-transitive graphs’, Combinatorica 1(3) (1981), 309311.CrossRefGoogle Scholar