Embeddability and Stresses of Graphs

Details Embeddability and Stresses of Graphs Embeddability and Stresses of Graphs

2004-10-31

arxiv.org/abs/math/0411009v1

Combinatorica 27 (2007), no. 4, 465--472.

Mathematics

Combinatorics

13 pages, 1 figure

Scientific paper

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 05.) 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.

Affiliated with

Also associated with

No associations

Rating

Embeddability and Stresses of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Embeddability and Stresses of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embeddability and Stresses of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286619