On embeddability and stresses of graphs

From MaRDI portal
Publication:950325

DOI10.1007/S00493-007-2168-XzbMATH Open1157.05331arXivmath/0411009OpenAlexW2016748008MaRDI QIDQ950325FDOQ950325


Authors: Eran Nevo Edit this on Wikidata


Publication date: 22 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0411009




Recommendations




Cites Work


Cited In (15)





This page was built for publication: On embeddability and stresses of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950325)