{
  "id": "1902.03881",
  "version": "v1",
  "published": "2019-02-11T14:01:32.000Z",
  "updated": "2019-02-11T14:01:32.000Z",
  "title": "The complexity of orientable graph manifolds",
  "authors": [
    "Alessia Cattabriga",
    "Michele Mulazzani"
  ],
  "comment": "6 pages",
  "categories": [
    "math.GT"
  ],
  "abstract": "We give an upper bound for the Matveev complexity of the whole class of closed orientable graph manifolds that is sharp for all the 14529 graph manifolds of the Recognizer catalogue (see http://matlas.math.csu.ru/?page=search ). The proof of this result will be contained in a forthcoming version of this paper.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-02-11T14:01:32.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M27",
      "57N10",
      "57R22"
    ],
    "keywords": [
      "upper bound",
      "matveev complexity",
      "closed orientable graph manifolds",
      "recognizer catalogue",
      "forthcoming version"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}