{
  "id": "2208.10936",
  "version": "v1",
  "published": "2022-08-16T06:53:36.000Z",
  "updated": "2022-08-16T06:53:36.000Z",
  "title": "Another Proof of the Four Colour Theorem -- Part 2 -- Discharging a minimal 5-Chromatic Planar Graph",
  "authors": [
    "Frank Allaire"
  ],
  "comment": "60 pages, 18 Figures, 7 Appendices, containing all exhaustive enumerations in < 500 cases",
  "categories": [
    "math.CO"
  ],
  "abstract": "In RSST, they \"replace the mammoth hand-checking of unavoidability that A&H required, by another mammoth hand-checkable proof \" (page 18). Here, the proof of unavoidability is accomplished in a lengthy structured hand-checkable proof whose entirety is presented in this document.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-08-16T06:53:36.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10",
      "05C21",
      "05C30"
    ],
    "keywords": [
      "planar graph",
      "colour theorem",
      "unavoidability",
      "mammoth hand-checkable proof",
      "discharging"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 60,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}