Finite transitive groups having many suborbits of cardinality at most two and an application to the enumeration of Cayley graphs
Abstract
Let G be a finite transitive group on a set , let α∈ and let Gα be the stabilizer of the point α in G. In this paper, we are interested in the proportion |\ω∈ ω lies in a Gα-orbit of cardinality at most two\|||, 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 5/6, then each element of lies in a suborbit of cardinality at most two 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.