On graph-restrictive permutation groups

DOI10.1016/J.JCTB.2011.11.006zbMATH Open1241.05044arXiv1101.5186OpenAlexW2002346221MaRDI QIDQ414655FDOQ414655

Authors: Pablo Spiga, Gabriel Verret, Primož Potočnik 

Publication date: 11 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: Let $Gamma$ be a connected $G$-vertex-transitive graph, let $v$ be a vertex of $Gamma$ and let $L=G_v^{Gamma(v)}$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $Gamma(v)$. Then $(Gamma,G)$ is said to be emph{locally-$L$}. A transitive permutation group $L$ is emph{graph-restrictive} if there exists a constant $c(L)$ such that, for every locally-$L$ pair $(Gamma,G)$ and an arc $(u,v)$ of $Gamma$, the inequality $|G_{uv}|leqc(L)$ holds. Using this terminology, the Weiss Conjecture says that primitive groups are graph-restrictive. We propose a very strong generalisation of this conjecture: a group is graph-restrictive if and only if it is semiprimitive. (A transitive permutation group is said to be emph{semiprimitive} if each of its normal subgroups is either transitive or semiregular.) Our main result is a proof of one of the two implications of this conjecture, namely that graph-restrictive groups are semiprimitive. We also collect the known results and prove some new ones regarding the other implication.

Full work available at URL: https://arxiv.org/abs/1101.5186

Recommendations

• On locally semiprimitive graphs and a theorem of Weiss
• A class of semiprimitive groups that are graph-restrictive
• On intransitive graph-restrictive permutation groups
• A theory of semiprimitive groups
• On finite G-locally primitive graphs and the Weiss conjecture

zbMATH Keywords

primitive grouparc-transitive graphsgraph-restrictive groupsemiprimitive groupWeiss conjecture

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Permutation groups (20B99)

Cites Work

• The Magma algebra system. I: The user language
• Title not available (Why is that?)
• On the Symmetry of Cubic Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex-transitive graphs
• On the Residual Finiteness of Generalised Free Products of Nilpotent Groups
• Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
• Normalizers of p-subgroups in finite groups
• Two local conditions on the vertex stabiliser of arc-transitive graphs and their effect on the Sylow subgroups
• ARC TRANSITIVITY IN GRAPHS
• Title not available (Why is that?)
• Title not available (Why is that?)
• An application of p-factorization methods to symmetric graphs
• THOMPSON–WIELANDT-LIKE THEOREMS REVISITED
• On the order of arc-stabilizers in arc-transitive graphs
• Graphs which are locally Grassmann
• On groups with every normal subgroup transitive or semiregular.
• Locally dihedral amalgams of odd type.
• On the Weiss conjecture for finite locally primitive graphs
• Title not available (Why is that?)

Cited In (23)

• On intransitive graph-restrictive permutation groups
• On the order of arc-stabilisers in arc-transitive graphs with prescribed local group
• GROUPS ACTING ON TREES WITH PRESCRIBED LOCAL ACTION
• An application of the local \(C(G,T)\) theorem to a conjecture of Weiss
• Vertex-transitive graphs with local action the symmetric group on ordered pairs
• A theory of semiprimitive groups
• Three local actions in 6‐valent arc‐transitive graphs
• On locally semiprimitive graphs and a theorem of Weiss
• On fixity of arc-transitive graphs
• The distinguishing number of quasiprimitive and semiprimitive groups
• On the orders of arc-transitive graphs
• On the order of Borel subgroups of group amalgams and an application to locally-transitive graphs.
• On orders of automorphisms of vertex-transitive graphs
• Graphs with automorphism groups admitting composition factors of bounded rank
• A class of semiprimitive groups that are graph-restrictive
• Permutation Groups and the Graph Isomorphism Problem
• On 2-arc-transitive graphs of order \(kp^{n}\)
• Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
• On the number of generators of groups acting arc-transitively on graphs
• Lifting a prescribed group of automorphisms of graphs
• A note on the Weiss conjecture
• Bounding the covolume of lattices in products
• On the order of arc-stabilisers in arc-transitive graphs. II

Uses Software

• Magma

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414655)