On intransitive graph-restrictive permutation groups

From MaRDI portal
Publication:402936

DOI10.1007/S10801-013-0482-5zbMATH Open1311.05210arXiv1211.3347OpenAlexW1982710566MaRDI QIDQ402936FDOQ402936


Authors: Pablo Spiga, Gabriel Verret Edit this on Wikidata


Publication date: 29 August 2014

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: Let Gamma be a finite connected G-vertex-transitive graph and let v be a vertex of Gamma. If the permutation group induced by the action of the vertex-stabiliser Gv on the neighbourhood Gamma(v) is permutation isomorphic to L, then (Gamma,G) is said to be locally-L. A permutation group L is graph-restrictive if there exists a constant c(L) such that, for every locally-L pair (Gamma,G) and a vertex v of Gamma, the inequality |Gv|leqc(L) holds. We show that an intransitive group is graph-restrictive if and only if it is semiregular.


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




Recommendations




Cites Work


Cited In (10)





This page was built for publication: On intransitive graph-restrictive permutation groups

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