Distance-transitive representations of the symmetric groups (Q1084111): Difference between revisions

Let \(\Gamma\) be a graph and G a subgroup of Aut(\(\Gamma)\). One says that G acts distance-transitively on \(\Gamma\) if, for any vertices x,y,u,v and such that \(d(x,y)=d(u,v)\), there is an element g in G that maps x to u to v; and then the permutation group induced by the action of G on V(\(\Gamma)\) is called the distance-transitive representation of G. Of course, Aut(\(\Gamma)\) also then acts distance-transitively on \(\Gamma\), and \(\Gamma\) is a so-called distance-transitive graph. It is of interest to classify distance-transitive graphs. The approach of this paper is to begin with the group G and find all its distance-transitive representations. It gives a classification theorem of all distance- transitive representations of the symmetric groups \(S_ n\).