OurBigBook About$ Donate
 Sign in Sign up

Geiringer–Laman theorem

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Discrete mathematics Theorems in discrete mathematics Theorems in graph theory
 0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (6)

  1. Theorems in graph theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook