{
  "id": "0902.4038",
  "version": "v4",
  "published": "2009-02-23T23:27:08.000Z",
  "updated": "2011-11-17T17:48:23.000Z",
  "title": "The conjugacy problem for the automorphism group of the random graph",
  "authors": [
    "Samuel Coskey",
    "Paul Ellis",
    "Scott Schneider"
  ],
  "comment": "7 pages",
  "journal": "Archive for Mathematical Logic (2011) 50(1):215--221",
  "doi": "10.1007/s00153-010-0210-y",
  "categories": [
    "math.LO"
  ],
  "abstract": "We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.",
  "revisions": [
    {
      "version": "v4",
      "updated": "2011-11-17T17:48:23.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "03E15",
      "03C15",
      "05C80",
      "08A35"
    ],
    "keywords": [
      "automorphism group",
      "random graph",
      "conjugacy problem",
      "borel complete"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0902.4038C"
    }
  }
}