Projects per year
Abstract
We characterise the primitive 2-closed groups G of rank at most four that are not the automorphism group of a graph or digraph and show that if the degree is at least 2402 then there are just two infinite families or G⩽AΓL1(pd), the 1-dimensional affine semilinear group. These are the first known examples of non-regular 2-closed groups that are not the automorphism group of a graph or digraph.
Original language | English |
---|---|
Pages (from-to) | 176-205 |
Number of pages | 30 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 158 |
DOIs | |
Publication status | Published - Jan 2023 |
Fingerprint
Dive into the research topics of 'On primitive 2-closed permutation groups of rank at most four'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Graph symmetry and simple groups
ARC Australian Research Council
20/02/19 → 19/02/23
Project: Research