AN ONANSCOTT THEOREM FOR FINITE QUASIPRIMITIVE PERMUTATION-GROUPS AND AN APPLICATION TO 2-ARC TRANSITIVE GRAPHS

A permutation group is said to be quasiprimitive if each of its nontrivial normal subgroups is transitive. A structure theorem for finite quasiprimitive permutation groups is proved, along the lines of the O'Nan-Scott Theorem for finite primitive permutation groups. It is shown that every finite, non-bipartite, 2-arc transitive graph is a cover of a quasiprimitive 2-arc transitive graph. The structure theorem for quasiprimitive groups is used to investigate the structure of quasiprimitive 2-arc transitive graphs, and a new construction is given for a family of such graphs.