Towards inductive proofs in algebraic combinatorics
From MaRDI portal
Abstract: We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family, showing that relatively straightforward induction arguments may possibly be used to solve problems in this family, and consequently for symmetry questions about vertex-transitive digraphs. As an example of this, for an odd prime, we use induction to determine the Sylow -subgroups of transitive groups of degree that contain a regular cyclic subgroup in this family. This is enough information to determine the automorphism groups of circulant digraphs of order .
This page was built for publication: Towards inductive proofs in algebraic combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437216)
