English

On intransitive graph-restrictive permutation groups

Combinatorics 2012-11-15 v1 Group Theory

Abstract

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

Keywords

Cite

@article{arxiv.1211.3347,
  title  = {On intransitive graph-restrictive permutation groups},
  author = {Pablo Spiga and Gabriel Verret},
  journal= {arXiv preprint arXiv:1211.3347},
  year   = {2012}
}

Comments

6 pages, 3 figures

R2 v1 2026-06-21T22:38:22.946Z