A class of semiprimitive groups that are graph‐restrictive

2014/09/04 by Michael Giudici, Luke Morgan · 3 citations
Mathematics · Computer Science · #Finite Group Theory Research #Limits and Structures in Graph Theory #Advanced Graph Theory Research

paper · doi:10.1112/blms/bdu076

Abstract

We prove that an infinite family of semiprimitive groups is graph‐restrictive. This adds to the evidence for the validity of the Potočnik–Spiga–Verret Conjecture and increases the minimal imprimitive degree for which this conjecture is open to 12. Our result can be seen as a generalization of the well‐known theorem of Tutte on cubic graphs. The proof uses the amalgam method, adapted to this new situation.

Cited by

• An application of the Local C(G,T) Theorem to a conjecture of Weiss
• Separating subsets from their images
• On transitive permutation groups with exponential graph growth

Related

• On graph-restrictive permutation groups
• A theory of semiprimitive groups
• Forbidden minors: Finding the finite few
• On intransitive graph-restrictive permutation groups
• Local expressions of hereditary classes