Research output per year
Research output per year
Lei Chen, Michael Giudici, Cheryl E. Praeger
Research output: Contribution to journal › Article › peer-review
The investigation of s-arc-transitivity of digraphs can be dated back to 1989 when the third author showed that s can be arbitrarily large if the action on vertices is imprimitive. However, the situation is completely different when the digraph is vertex-primitive and not a directed cycle. In 2017 the second author, Li and Xia constructed the first infinite family of G-vertex-primitive 2-arc-transitive examples, and asked if there is an upper bound on s for G-vertex-primitive s-arc-transitive digraphs that are not directed cycles. In 2018 the second author and Xia showed that if there is a largest such value of s then it will occur when G is almost simple. So far it has been shown that s⩽2 for almost simple groups whose socle is an alternating group or a projective special linear group. The contribution of this paper is to prove that s≤1 in the case of the Suzuki groups and the small Ree groups. We give constructions with s=1 to show that the bound is sharp.
Original language | English |
---|---|
Article number | 103729 |
Journal | European Journal of Combinatorics |
Volume | 112 |
DOIs | |
Publication status | Published - Aug 2023 |
Research output: Thesis › Doctoral Thesis