2000 character limit reached
Vertex-quasiprimitive $2$-arc-transitive digraphs
Published 2 Mar 2017 in math.CO | (1703.00666v2)
Abstract: We study vertex-quasiprimitive $2$-arc-transitive digraphs, reducing the problem of vertex-primitive $2$-arc-transitive digraphs to almost simple groups. This includes a complete classification of vertex-quasiprimitive $2$-arc-transitive digraphs where the action on vertices has O'Nan-Scott type SD or CD.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.