Rank three permutation groups with rank three subconstituents

P. J. Cameron; H. D. Macpherson

doi:10.1016/0095-8956(85)90034-6

Rank three permutation groups with rank three subconstituents

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

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	1-16
Number of pages	16
Journal	Journal of Combinatorial Theory, Series B
Volume	39
Issue number	1
DOIs	https://doi.org/10.1016/0095-8956(85)90034-6
Publication status	Published - 1 Jan 1985

Access to Document

10.1016/0095-8956(85)90034-6

Cite this

@article{876f5a74a7d94a71b1958b4c4a378859,

title = "Rank three permutation groups with rank three subconstituents",

abstract = "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.",

author = "Cameron, \{P. J.\} and Macpherson, \{H. D.\}",

year = "1985",

month = jan,

day = "1",

doi = "10.1016/0095-8956(85)90034-6",

language = "English",

volume = "39",

pages = "1--16",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press/Elsevier ",

number = "1",

}

TY - JOUR

T1 - Rank three permutation groups with rank three subconstituents

AU - Cameron, P. J.

AU - Macpherson, H. D.

PY - 1985/1/1

Y1 - 1985/1/1

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

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

UR - https://www.scopus.com/pages/publications/27844462102

U2 - 10.1016/0095-8956(85)90034-6

DO - 10.1016/0095-8956(85)90034-6

M3 - Article

AN - SCOPUS:27844462102

SN - 0095-8956

VL - 39

SP - 1

EP - 16

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 1

ER -

Rank three permutation groups with rank three subconstituents

Abstract

Access to Document

Other files and links

Fingerprint

Cite this