We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Let G be a finite transitive group on a set $\Omega $, let $\alpha \in \Omega $, and let $G_{\alpha }$ be the stabilizer of the point $\alpha $ in G. In this paper, we are interested in the proportion
$$ \begin{align*} \frac{|\{\omega\in \Omega\mid \omega \textrm{ lies in a }G_{\alpha}\textrm{-orbit of cardinality at most 2}\}|}{|\Omega|}, \end{align*} $$
that is, the proportion of elements of $\Omega $ lying in a suborbit of cardinality at most 2. We show that, if this proportion is greater than $5/6$, then each element of $\Omega $ lies in a suborbit of cardinality at most 2, and hence G is classified by a result of Bergman and Lenstra. We also classify the permutation groups attaining the bound $5/6$.
We use these results to answer a question concerning the enumeration of Cayley graphs. Given a transitive group G containing a regular subgroup R, we determine an upper bound on the number of Cayley graphs on R containing G in their automorphism groups.
In this paper a classification is obtained of all pairs G, H of finite primitive permutation groups such that G < H, the socles of G and H are different, and G and H share a common non-trivial orbital. An application is given to the study of automorphism groups of edge-transitive graphs.