On intransitive graph-restrictive permutation groups
Combinatorics
2012-11-15 v1 Group Theory
Abstract
Let be a finite connected -vertex-transitive graph and let be a vertex of . If the permutation group induced by the action of the vertex-stabiliser on the neighbourhood is permutation isomorphic to , then is said to be locally-. A permutation group is graph-restrictive if there exists a constant such that, for every locally- pair and a vertex of , the inequality holds. We show that an intransitive group is graph-restrictive if and only if it is semiregular.
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