Rank three permutation groups with rank three subconstituents (Q797675)

From MaRDI portal
Revision as of 18:56, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Rank three permutation groups with rank three subconstituents
scientific article

    Statements

    Rank three permutation groups with rank three subconstituents (English)
    0 references
    0 references
    0 references
    1985
    0 references
    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.
    0 references
    permutation groups of rank 3
    0 references
    finite undirected graphs
    0 references
    isomorphism between subgraphs
    0 references

    Identifiers