On a theorem of Goldschmidt (Q1095151)

Both \textit{P. Delgado, D. M. Goldschmidt} and \textit{B. Stellmacher} [Groups and graphs: New results and methods (1985; Zbl 0566.20013)] and \textit{B. Stellmacher} [Arch. Math. 46, 8-17 (1986; Zbl 0588.20013)] used a so- called ``pushing up'' approach (see latter reference for definition) in shortening \textit{D. M. Goldschmidt}'s original proof [Ann. Math. 111, 377- 407 (1980; Zbl 0475.05043)] of his theorem: Let \(\Gamma\) be a connected trivalent graph. Let \(\{\) x,y\(\}\) be an edge and G a group of automorphisms of \(\Gamma\) acting edge-transively such that \(G_ x\) is finite. Then \(| G_{xy}|\) divides \(2^ 7\). The present paper offers a simple proof that does not use pushing-up.