{
  "id": "1605.08597",
  "version": "v1",
  "published": "2016-05-27T11:59:19.000Z",
  "updated": "2016-05-27T11:59:19.000Z",
  "title": "Analytic combinatorics of connected graphs",
  "authors": [
    "Elie de Panafieu"
  ],
  "comment": "25 pages + 6 pages of appendix, 8 figures, long version of the talk arXiv:1604.07307 accepted at FPSAC 2016",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, i.e. generating function manipulations, we derive the complete asymptotic expansion.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-05-27T11:59:19.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "analytic combinatorics",
      "connected graphs",
      "complete asymptotic expansion",
      "first term",
      "linear number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 25,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}