{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Proof\n\nThe main idea of the proof is to observe that the [[Cayley graph|0GYQK9NDJF]] of *G*, with the addition of colors and orientations on its edges to distinguish the generators of *G* from each other, has the desired automorphism group. Therefore, if each of these edges is replaced by an appropriate subgraph, such that each replacement subgraph is itself asymmetric and two replacements are isomorphic if and only if they replace edges of the same color, then the undirected graph created by performing these replacements will also have *G* as its symmetry group.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "kind": "proof",
    "name": "Proof of Frucht's theorem",
    "proves": "W7Q3ZPF46B",
    "sources": [
      {
        "locator": "Frucht's theorem, section Proof idea",
        "mention": "wikipedia://en/26259599#XOGT",
        "note": "adopted",
        "sections": [
          "Proof"
        ],
        "wikipedia": "en:26259599@r1327421226"
      }
    ],
    "tag": "268FWM8ZMJ"
  },
  "kind": "proof",
  "link": "https://math2.tamnd.com/node/268FWM8ZMJ/",
  "links": [
    {
      "field": "proves",
      "target": "W7Q3ZPF46B"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/268FWM8ZMJ.md",
  "msc": null,
  "name": "Proof of Frucht's theorem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/268/268FWM8ZMJ.md",
  "status": null,
  "tag": "268FWM8ZMJ",
  "uri": "m2://268FWM8ZMJ",
  "url": "https://math2.tamnd.com/wiki/proof-of-fruchts-theorem/",
  "writing": {
    "tag": "268FWM8ZMJ",
    "kind": "proof",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge uses out",
        "note": "each node that the argument needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}