Characterization of families of rank 3 permutation groups by the subdegrees. I

DOI10.1007/BF01220896zbMath0245.20003MaRDI QIDQ2555145

D. G. Higman

Publication date: 1970

Published in: Archiv der Mathematik (Search for Journal in Brave)

Mathematics Subject Classification ID

05C99: Graph theory

20B20: Multiply transitive finite groups

20B10: Characterization theorems for permutation groups

Related Items

A category theory for programming languages, Automorphisms of semitriangular graphs with \(\mu =8\), Automorphisms of Higman graphs with \(\mu=6\), Parameters of semilinear Higman graphs, On automorphisms of semitriangular graphs with \(\mu = 8\), On automorphisms of semitriangular graphs with \(\mu = 7\), Automorphisms of semitriangular graphs with \(\mu = 6\), Permutation group approach to association schemes, On block designs arising from rank 3 graphs, Locally triangular graphs and rectagraphs with symmetry, Edge-symmetric semitriangular Higman graphs, Steiner systems which admit block transitive automorphism groups of small rank, Biplanes, Characterization of families of rank 3 permutation groups by the subdegrees. II

Cites Work

• Unnamed Item
• Unnamed Item
• 4-homogeneous groups
• Strongly regular graphs, partial geometries and partially balanced designs
• Finite permutation groups of rank 3
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• On the Uniqueness of the Triangular Association Scheme
• On the Exceptional Case in a Characterization of the Arcs of a Complete Graph