A class of semiprimitive groups that are graph-restrictive

DOI10.1112/BLMS/BDU076MaRDI QIDQ2933726zbMATH OpenOpenAlexFDO

Authors Michael Giudici, Luke Morgan

Publication date 5 December 2014

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.3086

zbMATH Keywords

graph-restrictive groupgraph-restrictive groupssemiprimitive permutation group

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Primitive groups (20B15) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Group actions on combinatorial structures (05E18)

Abstract: We prove that an infinite family of semiprimitive groups are graph-restrictive. This adds to the evidence for the validity of the PSV Conjecture and increases the minimal imprimitive degree for which this conjecture is open to 12. Our result can be seen as a generalisation of the well-known theorem of Tutte on cubic graphs. The proof uses the amalgam method, adapted to this new situation.

Recommendations

• On graph-restrictive permutation groups
• A theory of semiprimitive groups
• On locally semiprimitive graphs and a theorem of Weiss
• Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem
• The finite primitive groups with soluble stabilizers, and the edge-primitive \(s\)-arc transitive graphs.

Cites work

• scientific article; zbMATH DE number 1421046 (Why is no real title available?)
• scientific article; zbMATH DE number 3046496 (Why is no real title available?)
• ARC TRANSITIVITY IN GRAPHS
• Automorphisms of trivalent graphs
• Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
• GRAPHS WITH PROJECTIVE SUBORBITS
• GRAPHS WITH PROJECTIVE SUBORBITS. CASES OF SMALL CHARACTERISTICS. I
• Graphs with a locally linear group of automorphisms
• Graphs with automorphism groups admitting composition factors of bounded rank
• Graphs with projective suborbits. Exceptional cases of characteristic 2. I
• Graphs with projective suborbits. Exceptional cases of characteristic 2. II
• Graphs with projective suborbits. Exceptional cases of characteristic 2. III
• Graphs with projective suborbits. Exceptional cases of characteristic 2. IV
• Locally dihedral amalgams of odd type.
• On a theorem of Goldschmidt
• On graph-restrictive permutation groups
• On groups with every normal subgroup transitive or semiregular.
• On intransitive graph-restrictive permutation groups
• On the Symmetry of Cubic Graphs
• On the order of arc-stabilizers in arc-transitive graphs
• The group E₆(q) and graphs with a locally linear group of automorphisms
• Two local conditions on the vertex stabiliser of arc-transitive graphs and their effect on the Sylow subgroups

Cited in

(12)

• On intransitive graph-restrictive permutation groups
• On graph-restrictive permutation groups
• Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
• GROUPS ACTING ON TREES WITH PRESCRIBED LOCAL ACTION
• An application of the local \(C(G,T)\) theorem to a conjecture of Weiss
• Vertex-transitive graphs with local action the symmetric group on ordered pairs
• A theory of semiprimitive groups
• Three local actions in 6‐valent arc‐transitive graphs
• On locally semiprimitive graphs and a theorem of Weiss
• On fixity of arc-transitive graphs
• On the order of Borel subgroups of group amalgams and an application to locally-transitive graphs.
• On orders of automorphisms of vertex-transitive graphs

This page was built for publication: A class of semiprimitive groups that are graph-restrictive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933726)