| Display title | Geiringer–Laman theorem |
| Default sort key | Geiringer-Laman theorem |
| Page length (in bytes) | 31,969 |
| Namespace ID | 0 |
| Page ID | 336861 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Steve Marsio |
| Date of page creation | 21:03, 6 February 2024 |
| Latest editor | imported>Steve Marsio |
| Date of latest edit | 21:03, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The Geiringer–Laman theorem gives a combinatorial characterization of generically rigid graphs in $ 2 $-dimensional Euclidean space, 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... |
