{
  "id": "1204.2446",
  "version": "v2",
  "published": "2012-04-11T13:44:39.000Z",
  "updated": "2012-12-16T19:28:57.000Z",
  "title": "Random graphs with bounded maximum degree: asymptotic structure and a logical limit law",
  "authors": [
    "Vera Koponen"
  ],
  "journal": "Discrete Mathematics and Theoretical Computer Science, Vol. 14, No. 2 (2012) 229-254",
  "categories": [
    "math.CO"
  ],
  "abstract": "For any fixed integer $R \\geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled limit law for first-order logic. If $R \\geq 5$ then also an unlabelled limit law holds.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2012-12-16T19:28:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80",
      "03C13"
    ],
    "keywords": [
      "bounded maximum degree",
      "logical limit law",
      "asymptotic structure",
      "random graphs",
      "unlabelled limit law holds"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1204.2446K"
    }
  }
}