{
  "id": "math/0403450",
  "version": "v1",
  "published": "2004-03-25T21:33:26.000Z",
  "updated": "2004-03-25T21:33:26.000Z",
  "title": "The asymptotics of strongly regular graphs",
  "authors": [
    "Vladimir Nikiforov"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-03-25T21:33:26.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05E30"
    ],
    "keywords": [
      "asymptotics",
      "nontrivial strongly regular graphs",
      "disjoint cliques",
      "complement",
      "quasi-random"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math......3450N"
    }
  }
}