Linear groups and distance-transitive graphs (Q1824628): Difference between revisions

The main theorem of this paper reads as follows: Let G be a group with \(PSL(n,q)\trianglelefteq G\leq aut PSL(n,q),\) \(n\geq 2\) and (n,q)\(\neq (2,2)\), (2,3). If \(\Gamma\) is a connected graph of diameter at least 2 on which G acts primitively and distance-transitively, then either \(\Gamma\) is a Grassmann graph or \(K:=N_{aut \Gamma}(G^{\infty})\), \(\Gamma\) and the stabilizer H in K of a vertex are as listed in a Table (16 cases).