Source: wikibot/geiringer-laman-theorem
= Geiringer–Laman theorem
{wiki=Geiringer–Laman_theorem}
The Geiringer–Laman theorem is a result in the field of graph theory and combinatorial geometry, specifically concerning the rigidity of frameworks. The theorem provides a criterion for determining when a certain kind of graph, known as a "framework", can be considered rigid, meaning that its vertices cannot be moved without distorting the distances between them.