2015
DOI: 10.1016/j.jalgebra.2014.12.017
|View full text |Cite
|
Sign up to set email alerts
|

On locally semiprimitive graphs and a theorem of Weiss

Abstract: In this paper we investigate graphs that admit a group acting arc-transitively such that the local action is semiprimitive with a regular normal nilpotent subgroup. This type of semiprimitive group is a generalisation of an affine group. We show that if the graph has valency coprime to six, then there is a bound on the order of the vertex stabilisers depending on the valency alone. We also prove a detailed structure theorem for the vertex stabilisers in the remaining case. This is a contribution to an ongoing … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
16
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 11 publications
(16 citation statements)
references
References 11 publications
(50 reference statements)
0
16
0
Order By: Relevance
“…As u and w are both neighbours of v, we have G [3] u ≤ G [1] vw . Therefore G [3] u ≤ Q w and hence Z w centralises G [3] u .…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…As u and w are both neighbours of v, we have G [3] u ≤ G [1] vw . Therefore G [3] u ≤ Q w and hence Z w centralises G [3] u .…”
Section: Preliminariesmentioning
confidence: 99%
“…As u and w are both neighbours of v, we have G [3] u ≤ G [1] vw . Therefore G [3] u ≤ Q w and hence Z w centralises G [3] u . As G [3] u is G uinvariant, X centralises G [3] u and hence also G…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…. Tutte's result [28] can then be rephrased as saying that transitive groups of degree 3 are graph-restrictive (with corresponding constant 16), while the famous Weiss conjecture [31] claims that every primitive permutation group is graph-restrictive; see [17] for a survey of results on graph-restrictiveness and [2,9,10,26] for more recent results.…”
Section: Introductionmentioning
confidence: 99%
“…This class of permutation groups was introduced by Bereczky and Maróti [5] who were motivated by an interest in universal algebras and the structure of collapsing monoids. Semiprimitive groups have been the topic of several recent papers [11,12,35], motivated by the connection to the Weiss Conjecture in graph theory [30,36,39], via the Potočnik-Spiga-Verret Conjecture [24].…”
Section: Introductionmentioning
confidence: 99%