{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $G$ be a finite [[planar graph|029JQEK15B]].\nThen $\\chi(G) \\le 5$.\n\n## Remarks\n\nProof idea: $G$ has a vertex $v$ of degree at most $5$, by the [[edge bound for planar graphs|0SM1REAVYJ]]. Colour $G - v$ by induction.\nIf the neighbours of $v$ use all five colours, a swap of two colours along a Kempe chain frees one colour for $v$.\nThe [[four colour theorem|0M406JC8J1]] is stronger, but its proof is much harder.\n\n## History\n\nPercy John Heawood proved the theorem in 1890.\nHe found an error in the 1879 proof of the four colour theorem by Alfred Kempe, and he used Kempe's ideas to prove five colours.\n\n## Explanations\n\n### L1 human\n\nEvery map can be coloured with five colours so that neighbouring countries have different colours.\nThe proof is short, unlike the proof that four colours are enough.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "inventory": [
      "MKSEZWAP3R"
    ],
    "kind": "statement",
    "msc": [
      "05C15",
      "05C10"
    ],
    "name": "Five colour theorem",
    "role": "theorem",
    "same_as": {
      "wikidata": "Q105222412",
      "wikipedia": "Five color theorem"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Five_color_theorem"
      }
    ],
    "tag": "06C0JBE52D",
    "uses": [
      "029JQEK15B",
      "0C5M7AM6FH"
    ]
  },
  "kind": "statement",
  "link": "https://tamnd.github.io/math2/node/06C0JBE52D/",
  "links": [
    {
      "field": "uses",
      "target": "029JQEK15B"
    },
    {
      "field": "uses",
      "target": "0C5M7AM6FH"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/06C0JBE52D.md",
  "msc": [
    "05C15",
    "05C10"
  ],
  "name": "Five colour theorem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/06C/06C0JBE52D.md",
  "status": null,
  "tag": "06C0JBE52D",
  "uri": "m2://06C0JBE52D",
  "url": "https://tamnd.github.io/math2/wiki/five-colour-theorem/",
  "writing": {
    "tag": "06C0JBE52D",
    "kind": "statement",
    "level": "W1",
    "next": [
      {
        "what": "edge about out",
        "note": "the concepts that the statement is about",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge proves in",
        "note": "at least one proof node",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of or illustrates in",
        "note": "one example that shows the statement at work",
        "have": 0,
        "want": 1
      },
      {
        "what": "explanation L2",
        "have": 0,
        "want": 1
      }
    ]
  }
}