A class of semiprimitive groups that are graph-restrictive

From MaRDI portal
Publication:2933726

DOI10.1112/BLMS/BDU076zbMATH Open1320.05058arXiv1401.3086OpenAlexW2030949718MaRDI QIDQ2933726FDOQ2933726


Authors: Michael Giudici, Luke Morgan Edit this on Wikidata


Publication date: 5 December 2014

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

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.


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




Recommendations




Cites Work


Cited In (12)





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)