Meanings
- A theorem giving a combinatorial characterization of generically rigid graphs in two-dimensional Euclidean space, with respect to bar-joint frameworks.
Origin
It was proved by Hilda Pollaczek-Geiringer in 1927, and by Gerard Laman in 1970.
Full word history & related roots →Cite this entry
Geiringer-Laman theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 5, 2026, from https://dictionary.watkinsx.com/word/Geiringer-Laman%20theorem
“Geiringer-Laman theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Geiringer-Laman%20theorem. Accessed November 5, 2026.
WatkinsX Dictionary, s.v. “Geiringer-Laman theorem,” accessed November 5, 2026, https://dictionary.watkinsx.com/word/Geiringer-Laman%20theorem.
Source: Geiringer-Laman theorem on Wiktionary, CC BY-SA 4.0.