2000 character limit reached
Inclusions of innately transitive groups into wreath products in product action with applications to $2$-arc-transitive graphs
Published 3 Jul 2015 in math.GR | (1507.01049v1)
Abstract: We study $(G,2)$-arc-transitive graphs for innately transitive permutation groups $G$ such that $G$ can be embedded into a wreath product $\sym\Gamma\wr\sy\ell$ acting in product action on $\Gamma\ell$. We find two such connected graphs: the first is Sylvester's double six graph with 36 vertices, while the second is a graph with $1202$ vertices whose automorphism group is $\aut\sp 44$. We prove that under certain conditions no more such graphs exist.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.