On intransitive graph-restrictive permutation groups (Q402936): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3994461 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3681018 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graph-restrictive permutation groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3341041 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON THE ORDER OF ARC-STABILIZERS IN ARC-TRANSITIVE GRAPHS / rank | |||
Normal rank |
Latest revision as of 23:40, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On intransitive graph-restrictive permutation groups |
scientific article |
Statements
On intransitive graph-restrictive permutation groups (English)
0 references
29 August 2014
0 references
Let \(P\) be a finite permutation group of degree \(d\). Then \(P\) is called graph-restrictive if there exists a constant \(c = c(P)\) with the property that if \(G\) is any group of automorphisms of a finite \(d\)-valent graph \(X\) acting transitively on the vertices of \(X\), such that the group \(G_v^{\,X(v)}\) induced by the stabiliser \(G_v\) of any vertex \(v\) of \(X\) on the neighbourhood \(X(v)\) of \(v\) in \(X\) is permutationally isomorphic to \(P\), then \(|G_v| \leq c(P)\). This definition makes graph-restrictive permutation groups play an important role in considering various conjectures about bounds on the orders of vertex-stabilisers in vertex-transitive group actions on graphs. The problem of determining which permutation groups are graph-restrictive was posed by the second author in [Bull. Aust. Math. Soc. 80, No. 3, 498--505 (2009; Zbl 1177.05054)]. In this paper, the authors completely solve the problem for the intransitive case, by proving that an intransitive finite permutation group \(P\) is graph-restrictive if and only if it is semi-regular (that is, if and only if all point-stabilisers in \(P\) are trivial).
0 references
permutation group
0 references
semi-regular permutation group
0 references
vertex-transitive graph
0 references
graph-restrictive permutation group
0 references