Rank three permutation groups with rank three subconstituents

P. J. Cameron*, H. D. Macpherson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


Finite 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.

Original languageEnglish
Pages (from-to)1-16
Number of pages16
JournalJournal of Combinatorial Theory, Series B
Issue number1
Publication statusPublished - 1 Jan 1985


Dive into the research topics of 'Rank three permutation groups with rank three subconstituents'. Together they form a unique fingerprint.

Cite this