{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "0J6G5NJC5R"
    }
  ],
  "body": "\n## Statement\n\nThe [[complete graph|03WKB2H474]] $K_5$ and the [[complete bipartite graph|0V0GC7BQAN]] $K_{3,3}$ are not [[planar|029JQEK15B]].\n\n## Remarks\n\nThe graph $K_5$ has $5$ vertices and $10$ edges. The [[edge bound for planar graphs|0SM1REAVYJ]] allows at most $3 \\cdot 5 - 6 = 9$ edges.\nThe graph $K_{3,3}$ has $6$ vertices and $9$ edges, and it has no cycle of length $3$. The bound $e \\le 2v - 4$ allows at most $8$ edges.\nThe statement for $K_{3,3}$ is the three utilities problem: three houses cannot each be joined to three utilities without crossings.\n\n## Explanations\n\n### L1 human\n\nTry to join each of three houses to each of three utilities with lines that never cross.\nIt is impossible, and the reason is a count of edges and faces.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "kind": "statement",
    "msc": [
      "05C10"
    ],
    "name": "K5 and K3,3 are not planar",
    "role": "proposition",
    "sources": [
      {
        "locator": "Unsolvability",
        "url": "https://en.wikipedia.org/wiki/Three_utilities_problem"
      }
    ],
    "tag": "030A3FHN14",
    "uses": [
      "03WKB2H474",
      "0V0GC7BQAN",
      "029JQEK15B",
      "0SM1REAVYJ"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/030A3FHN14/",
  "links": [
    {
      "field": "uses",
      "target": "03WKB2H474"
    },
    {
      "field": "uses",
      "target": "0V0GC7BQAN"
    },
    {
      "field": "uses",
      "target": "029JQEK15B"
    },
    {
      "field": "uses",
      "target": "0SM1REAVYJ"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/030A3FHN14.md",
  "msc": [
    "05C10"
  ],
  "name": "K5 and K3,3 are not planar",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/030/030A3FHN14.md",
  "status": null,
  "tag": "030A3FHN14",
  "uri": "m2://030A3FHN14",
  "url": "https://math2.tamnd.com/wiki/k5-and-k3-3-are-not-planar/",
  "writing": {
    "tag": "030A3FHN14",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}
