Geiringer-Laman theorem
Jump to navigation
Jump to search
English
[edit]Etymology
[edit]It was proved by Hilda Pollaczek-Geiringer in 1927, and by Gerard Laman in 1970.
Proper noun
[edit]- A theorem giving a combinatorial characterization of generically rigid graphs in two-dimensional Euclidean space, with respect to bar-joint frameworks.