2011/02/28 by Cai Heng Li, Hua Zhang · 4 citations
Mathematics · Engineering · Computer Science · #Finite Group Theory Research #graph theory and CDMA systems #Advanced Graph Theory Research
paper · doi:10.1112/plms/pdr004
Motivated by the study of several problems in algebraic graph theory, we study finite primitive permutation groups whose point stabilizers are soluble. Such primitive permutation groups are divided into three types: affine, almost simple and product action, and the product action type can be reduced to the almost simple type. This paper gives an explicit list of the soluble maximal subgroups of almost simple groups. The classification is then applied to classify edge-primitive s-arc transitive graphs with s ⩾ 4, solving a problem proposed by Richard M. Weiss (1999).