On the strong connectivity of the 2-Engel graphs of almost simple groups
arXiv:2304.09610
Abstract
The Engel graph of a finite group is a directed graph encoding the pairs of elements in satisfying some Engel word. Recent work of Lucchini and the third author shows that, except for a few well-understood cases, the Engel graphs of almost simple groups are strongly connected. In this paper, we give a refinement to this analysis.