On intransitive graph-restrictive permutation groups

Abstract: Let

G a m m a

be a finite connected

G

-vertex-transitive graph and let

v

be a vertex of

G a m m a

. If the permutation group induced by the action of the vertex-stabiliser

G_{v}

on the neighbourhood

G a m m a (v)

is permutation isomorphic to

L

, then

(G a m m a, 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

(G a m m a, G)

and a vertex

v

of

G a m m a

, the inequality

| G_{v} | l e q c (L)

holds. We show that an intransitive group is graph-restrictive if and only if it is semiregular.

Recommendations

Cites work

Cited in

(10)

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