Let be a finite transitive group on a set , let $\alpha\in \OmegaG_\alpha\alphaG$. In this paper, we are interested in the proportion that is, the proportion of elements of lying in a suborbit of cardinality at most two. We show that, if this proportion is greater than , then each element of lies in a suborbit of cardinality at most two and hence is classified by a result of Bergman and Lenstra. We also classify the permutation groups attaining the bound . We use these results to answer a question concerning the enumeration of Cayley graphs. Given a transitive group containing a regular subgroup , we determine an upper bound on the number of Cayley graphs on containing in their automorphism groups.

生成讲解博客的中文版本

生成AI智能校验的中文版本