The finite vertex-primitive and vertex-biprimitive \(s\)-transitive graphs for \(s\geq 4\) (Q2716147)

An \(s\)-arc in a finite graph \(G\) is a path of length \(s\) in which no edge is traversed in both directions in succession. \(G\) is called \(s\)-transitive if \(\Aut(G)\) acts transitively on the set of \(s\)-arcs of \(G\), but not on the set of (\(s+1\))-arcs. It is known that there are finite \(s\)-arc transitive graphs only for \(s=1,2,3,4,5\) and \(7\). NEWLINENEWLINENEWLINEThe author constructs a new 4-transitive graph whose automorphism group is the Monster, and a family of 4-transitive graphs whose automorphism groups are \(\text{PSp}(4,p)\), one for each prime \(p \equiv \pm 1 \pmod 8\), and proves that these, together with previously known examples, are the only vertex-primitive \(s\)-transitive graphs for \(s \geq 4\). (A graph is called vertex-primitive if its automorphism group acts primitively on the set of vertices.) NEWLINENEWLINENEWLINEA bipartite graph \(G\) is called vertex-biprimitive if the stabilizer in \(\Aut(G)\) of each of the biparts acts primitively on the bipart. The author constructs new examples of \(4\)-, \(5\)- and \(7\)-transitive vertex-biprimitive graphs, and proves that these, together with previously known examples, are the only such graphs.