{
  "id": "1702.08373",
  "version": "v1",
  "published": "2017-02-27T16:52:55.000Z",
  "updated": "2017-02-27T16:52:55.000Z",
  "title": "Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph",
  "authors": [
    "Anita Liebenau",
    "Nick Wormald"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper we derive a result that establishes the validity of a model for a basic parameter of a random graph, its degree sequence. Simultaneously, the result gives an asymptotic formula for the number of graphs with given degree sequence, which is also of fundamental importance. The results verify two conjectures of McKay and Wormald made in 1990 and 1997.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-02-27T16:52:55.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "degree sequence",
      "random graph",
      "asymptotic enumeration",
      "basic parameter",
      "asymptotic formula"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}