Tetravalent 2-arc-transitive Cayley graphs on non-abelian simple groups
Abstract
A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut() has a single orbit on ordered paths of length 2, and for G≤ Aut(), is G-regular if G is regular on the vertex set of . Let G be a finite non-abelian simple group and let be a connected tetravalent 2-arc-transitive G-regular graph. In 2004, Fang, Li and Xu proved that either G () or G is one of 22 possible candidates. In this paper, the number of candidates is reduced to 7, and for each candidate G, it is shown that () has a normal arc-transitive non-abelian simple subgroup T such that G≤ T and the pair (G,T) is explicitly given
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.