{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nThe **Geiringer–Laman theorem** gives a combinatorial characterization of generically rigid graphs\u003csup\u003e*not defined at the linked page*\u003c/sup\u003e in $2$-dimensional [[Euclidean space|0XPR1E85W0]], with respect to bar-joint frameworks. This theorem was first proved by Hilda Pollaczek-Geiringer in 1927, and later by Gerard Laman in 1970. An efficient algorithm called the pebble game is used to identify this class of graphs. This theorem has been the inspiration for many Geiringer-Laman type results for other types of frameworks with generalized pebble games.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "3EVHGCHN0Z"
    ],
    "kind": "statement",
    "name": "Geiringer–Laman theorem",
    "role": "proposition",
    "same_as": {
      "wikidata": "Q111955295",
      "wikipedia": "Geiringer–Laman theorem"
    },
    "sources": [
      {
        "locator": "Geiringer–Laman theorem",
        "mention": "wikipedia://en/66490111",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:66490111@r1369352305"
      }
    ],
    "tag": "SET315RZTV"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/SET315RZTV/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/SET315RZTV.md",
  "msc": null,
  "name": "Geiringer–Laman theorem",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/SET/SET315RZTV.md",
  "status": null,
  "tag": "SET315RZTV",
  "uri": "m2://SET315RZTV",
  "url": "https://math2.tamnd.com/wiki/geiringer-laman-theorem/",
  "writing": {
    "tag": "SET315RZTV",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}