Embeddability and Stresses of Graphs
| dc.creator | Nevo, Eran | |
| dc.date | 2004-10-31 | |
| dc.date.accessioned | 2026-07-07T10:00:26Z | |
| dc.date.available | 2026-07-07T10:00:26Z | |
| dc.description | Gluck (1975) has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that linklessly embeddable graphs are generically 4-stress free. Both of these results are corollaries of the following theorem: every K_{r+2}-minor free graph is generically r-stress free for 0<r<5. (This assertion is false for r>5.) We give an equivalent formulation of this theorem in the language of symmetric algebraic shifting and show that its analogue for exterior algebraic shifting also holds. Some further extensions are detailed. | |
| dc.description | 13 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0411009 | |
| dc.identifier | http://arxiv.org/abs/math/0411009 | |
| dc.identifier | Combinatorica 27 (2007), no. 4, 465--472. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168324 | |
| dc.subject | Combinatorics | |
| dc.subject | 05,05C83,52C25 | |
| dc.title | Embeddability and Stresses of Graphs | |
| dc.type | text |