Rank three permutation groups with rank three subconstituents

AbstractFinite permutation groups of rank 3 such that both the subconstituents have rank 3 are classified. This is equivalent to classifying all finite undirected graphs with the following property: every isomorphism between subgraphs on at most three vertices is a restriction of an automorphism of the graph