A class of semiprimitive groups that are graph-restrictive

Michael Giudici, Luke Morgan

    Research output: Contribution to journalArticle

    430 Downloads (Pure)

    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.
    Original languageEnglish
    Pages (from-to)1226-1236
    JournalBulletin of the London Mathematical Society
    Volume46
    Issue number6
    Early online date4 Sep 2014
    DOIs
    Publication statusPublished - Dec 2014

    Fingerprint Dive into the research topics of 'A class of semiprimitive groups that are graph-restrictive'. Together they form a unique fingerprint.

    Cite this