On intransitive graph-restrictive permutation groups

preprint2012arXivOpen access

Abstract

Let ΓΓ be a finite connected GG-vertex-transitive graph and let vv be a vertex of ΓΓ. If the permutation group induced by the action of the vertex-stabiliser GvG_v on the neighbourhood Γ(v)Γ(v) is permutation isomorphic to LL, then (Γ,G)(Γ,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)(Γ,G) and a vertex vv of ΓΓ, the inequality ∣Gv∣≤c(L)|G_v|\leq c(L) holds. We show that an intransitive group is graph-restrictive if and only if it is semiregular.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.