Vertex-primitive s-arc-transitive digraphs of linear groups
Abstract
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≤slant2 for such digraphs, which provides the first step in determining an upper bound on s for all the vertex-primitive s-arc-transitive digraphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.