On the Weiss conjecture for finite locally primitive graphs (Q4487708)

A graph \(\Gamma\) is said to be locally primitive if, for every vertex \(\alpha\), the stabilizer of \(\alpha\) in the automorphism group \(\Aut\Gamma\) induces a primitive permutation group on the set of vertices adjacent to \(\alpha\). Main theorem: The Weiss conjecture is true for all finite non-bipartite graphs if and only if the almost Weiss conjecture is true. In 1978, Richard Weiss conjectured that for a finite vertex-transitive locally primitive graph \(\Gamma\) the number of automorphisms fixing a given vertex is bounded above by some function of the valency of \(\Gamma\). The authors prove that this conjecture is true for finite non-bipartite graphs provided that it is true in the case in which \(\Aut\Gamma\) contains a locally primitive subgroup that is almost simple.