A class of semiprimitive groups that are graph-restrictive

Michael Giudici; Luke Morgan

doi:10.1112/blms/bdu076

A class of semiprimitive groups that are graph-restrictive

Michael Giudici, Luke Morgan

Research output: Contribution to journal › Article

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 language	English
Pages (from-to)	1226-1236
Journal	Bulletin of the London Mathematical Society
Volume	46
Issue number	6
Early online date	4 Sep 2014
DOIs	https://doi.org/10.1112/blms/bdu076
Publication status	Published - Dec 2014

Access to Document

10.1112/blms/bdu076

Download full text
This is a pre-copyedited, author-produced PDF of an article accepted for publication in Bulletin of the London Mathematical Society following peer review. The version of record Giudici, M., & Morgan, L. (2014). A class of semiprimitive groups that are graph-restrictive. Bulletin of the London Mathematical Society, 46(6), 1226-1236 is available online at: http://dx.doi.org/10.1112/blms/bdu076
Accepted author manuscript, 170 KB

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

Cite this

@article{5b024b0a397f410584f6fd5b139fd8fb,

title = "A class of semiprimitive groups that are graph-restrictive",

abstract = "We prove that an infinite family of semiprimitive groups is graph-restrictive. This adds to the evidence for the validity of the Poto{\v c}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. ",

author = "Michael Giudici and Luke Morgan",

year = "2014",

month = dec,

doi = "10.1112/blms/bdu076",

language = "English",

volume = "46",

pages = "1226--1236",

journal = "Bulletin of the London Mathematical Society",

issn = "0024-6093",

publisher = "Oxford University Press",

number = "6",

}

TY - JOUR

T1 - A class of semiprimitive groups that are graph-restrictive

AU - Giudici, Michael

AU - Morgan, Luke

PY - 2014/12

Y1 - 2014/12

N2 - 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.

AB - 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.

U2 - 10.1112/blms/bdu076

DO - 10.1112/blms/bdu076

M3 - Article

VL - 46

SP - 1226

EP - 1236

JO - Bulletin of the London Mathematical Society

JF - Bulletin of the London Mathematical Society

SN - 0024-6093

IS - 6

ER -