Geiringer-Laman theorem
Geiringer-Laman theorem proper noun: a theorem giving a combinatorial characterization of generically rigid graphs in two-dimensional Euclidean space, with respect to bar-joint frameworks.
Proper noun
the Geiringer-Laman theorem
- A theorem giving a combinatorial characterization of generically rigid graphs in two-dimensional Euclidean space, with respect to bar-joint frameworks.
Origin of Geiringer-Laman theorem
It was proved by Hilda Pollaczek-Geiringer in 1927, and by Gerard Laman in 1970.
Questions about Geiringer-Laman theorem
- What does Geiringer-Laman theorem mean?
- Geiringer-Laman theorem means a theorem giving a combinatorial characterization of generically rigid graphs in two-dimensional Euclidean space, with respect to bar-joint frameworks.
- What part of speech is Geiringer-Laman theorem?
- Geiringer-Laman theorem is a proper noun.
Words near Geiringer-Laman theorem in the dictionary
Source and license
Adapted from Wiktionary: Geiringer-Laman theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Geiringer-Laman theorem.” Word.ws, https://word.ws/geiringer-laman_theorem. Based on Wiktionary, CC BY-SA 4.0.
