{
  "id": "1805.05387",
  "version": "v1",
  "published": "2018-05-14T19:10:59.000Z",
  "updated": "2018-05-14T19:10:59.000Z",
  "title": "Almost every $n$-vertex graph is determined by its $3 \\log_2{n}$-vertex subgraphs",
  "authors": [
    "Ameneh Farhadian"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The paper shows that almost every $n$-vertex graph is, uniquely, determined by its subgraphs with $3 \\log_2{n}$ vertices. Therefore, for checking the isomorphism of almost every pair of $n$-vertex graphs, it is sufficient to compare their $3 \\log_2{n}$-vertex subgraphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-05-14T19:10:59.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C60"
    ],
    "keywords": [
      "vertex graph",
      "vertex subgraphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}