Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph

DOI10.1016/j.jctb.2011.11.004zbMath1241.05045arXiv1102.1543WikidataQ56987560 ScholiaQ56987560MaRDI QIDQ414654

Cheryl E. Praeger, Gabriel Verret, Pablo Spiga

Publication date: 11 May 2012

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

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

zbMATH Keywords

Weiss conjecture; almost simple groups; normal quotients; quasiprimitive groups

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

20B99: Permutation groups

Related Items

Inclusions of innately transitive groups into wreath products in product action with applications to 2-arc-transitive graphs, Asymptotic enumeration of vertex-transitive graphs of fixed valency, On \(G\)-locally primitive graphs of locally twisted wreath type and a conjecture of Weiss, Semiregular automorphisms of cubic vertex-transitive graphs and the abelian normal quotient method, A theory of semiprimitive groups, On the order of Borel subgroups of group amalgams and an application to locally-transitive graphs., An application of the Local C(G,T) Theorem to a conjecture of Weiss, Graphs with automorphism groups admitting composition factors of bounded rank, Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem, A class of semiprimitive groups that are graph-restrictive

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graph-restrictive permutation groups
• Finite transitive permutation groups and bipartite vertex-transitive graphs
• On groups with every normal subgroup transitive or semiregular.
• Graphs and finite permutation groups
• Graphs with automorphism groups admitting composition factors of bounded rank
• On the Sims Conjecture and Distance Transitive Graphs
• An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
• Primitive Subgroups of Wreath Products in Product Action
• Permutation Groups with Projective Unitary Subconstituents
• An application of p-factorization methods to symmetric graphs
• Graphs with projective suborbits. Exceptional cases of characteristic 2. I
• GRAPHS WITH PROJECTIVE SUBORBITS
• On the Weiss conjecture for finite locally primitive graphs
• Graphs with projective suborbits. Exceptional cases of characteristic 2. II
• Graphs with projective suborbits. Exceptional cases of characteristic 2. IV
• Graphs with projective suborbits. Exceptional cases of characteristic 2. III
• GRAPHS WITH PROJECTIVE SUBORBITS. CASES OF SMALL CHARACTERISTICS. I
• GRAPHS WITH PROJECTIVE SUBORBITS. CASES OF SMALL CHARACTERISTICS. II
• Intransitive Cartesian decompositions preserved by innately transitive permutation groups
• ARC TRANSITIVITY IN GRAPHS
• Collapsing permutation groups.