{
  "id": "0906.5389",
  "version": "v1",
  "published": "2009-06-30T00:35:06.000Z",
  "updated": "2009-06-30T00:35:06.000Z",
  "title": "Comparison of two techniques for proving nonexistence of strongly regular graphs",
  "authors": [
    "Vasek Chvatal"
  ],
  "journal": "Graphs and Combinatorics 27 (2011), 171 - 175",
  "categories": [
    "math.CO"
  ],
  "abstract": "We show that the method of counting closed walks in strongly regular graphs rules out no parameter sets other than those ruled out by the method of counting eigenvalue multiplicities.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-06-30T00:35:06.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05E30"
    ],
    "keywords": [
      "proving nonexistence",
      "techniques",
      "comparison",
      "strongly regular graphs rules",
      "parameter sets"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0906.5389C"
    }
  }
}