Talk:Geiringer–Laman theorem

Article summary

This page is one in a collection of pages on rigidity theory, distance geometry, and configuration spaces of flexible frameworks. Below is the list of wikipedia usernames who wrote the draft pages. Below is a diagram of these pages (colored) showing how they connect to each other and to larger areas (gray).

Automated geometry theorem proving - Alexcooper, User:Meera Sitharam

Cayley configuration space - Ajha, William Sims, Yichi Zhang, User:Meera Sitharam

Decomposition Recombination Planning - Rahul Prabhu, User:Meera Sitharam

Distance geometry - Micstein, William Sims, User:Meera Sitharam

Distance geometry: Cayley Menger Relations - Abhik18, User:Meera Sitharam

Geiringer-Laman theorem - William Sims, Vriddhipai, User:Meera Sitharam

Geometric constraint solving - Kyleshihhuanglo, Rahul Prabhu, User:Meera Sitharam

Geometric constraint system - Cwphang, Kyuseopark, Rahul Prabhu, William Sims, User:Meera Sitharam

Geometric rigidity - W.garcia, William Sims

Graph flattenability - William Sims, User:Meera Sitharam

Pebble game - Adityatharad, User:Meera Sitharam

Quadratic solvability - Yichi Zhang, User:Meera Sitharam

Sparsity matroid - Banouge, William Sims, Vriddhipai, User:Meera Sitharam

Structural rigidity - William sims, Tgandi, User:Meera Sitharam

Tree-decomposable graph - Bhattabhishek, William Sims, User:Meera Sitharam

, User:Meera Sitharam

User:Meera Sitharam William Sims (talk) 23:42, 25 January 2021 (UTC)

Erroneous statement - how to fix?

The following bullet point in the article seems not quite right (underline by me to emphasize the contradiction):

• $G$ contains three edge-disjoint spanning trees $T_{1},T_{2},$ and $T_{3}$ such that (i) each vertex of $G$ is contained in exactly two of these spanning trees [...]

A spanning tree contains, by definition, all vertices of the graph. So each vertex is contained in all of them, not only two. I don't know what would be the correct statement. MWinter4 (talk) 13:05, 8 November 2023 (UTC)