{
  "id": "2304.09610",
  "version": "v1",
  "published": "2023-04-19T12:32:10.000Z",
  "updated": "2023-04-19T12:32:10.000Z",
  "title": "On the strong connectivity of the 2-Engel graphs of almost simple groups",
  "authors": [
    "F. Dalla Volta",
    "F. Mastrogiacomo",
    "P. Spiga"
  ],
  "categories": [
    "math.GR",
    "math.CO"
  ],
  "abstract": "The Engel graph of a finite group $G$ is a directed graph encoding the pairs of elements in $G$ 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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-04-19T12:32:10.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "simple groups",
      "strong connectivity",
      "engel graph",
      "finite group",
      "engel word"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}