2017/10/26 by Giudici, Michael, Li, Cai Heng, Xia, Binzhou
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1710.09518
We study G-vertex-primitive and (G,s)-arc-transitive digraphs for almost simple groups G with socle PSLn(q). It turns out that s\leqslant2 for such digraphs, which provides the first step in determining an upper bound on s for all the vertex-primitive s-arc-transitive digraphs.