{
  "id": "2012.05222",
  "version": "v1",
  "published": "2020-12-09T18:36:11.000Z",
  "updated": "2020-12-09T18:36:11.000Z",
  "title": "Isomorphic Bisections of Cubic Graphs",
  "authors": [
    "Shagnik Das",
    "Alexey Pokrovskiy",
    "Benny Sudakov"
  ],
  "comment": "13 pages, 5 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990's, Ando conjectured that the vertices of every cubic graph can be partitioned into two parts that induce isomorphic subgraphs. Using probabilistic methods together with delicate recolouring arguments, we prove Ando's conjecture for large connected graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-12-09T18:36:11.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C51"
    ],
    "keywords": [
      "cubic graph",
      "isomorphic bisections",
      "throughout discrete mathematics",
      "induce isomorphic subgraphs",
      "probabilistic methods"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}