1. Steinitz Representations László Lovász Microsoft Research One Microsoft Way, Redmond, WA 98052 lovasz@microsoft.com

2. Steinitz 1922 Every 3-connected planar graph is the skeleton of a convex 3-polytope. 3-connected planar graph

3. Coin representation Every planar graph can be represented by touching circles Koebe (1936)

4. Polyhedral version Andre’ev Every 3-connected planar graph is the skeleton of a convex polytope such that every edge touches the unit sphere

5. From polyhedra to circles horizon

6. From polyhedra to representation of the dual

7. Rubber bands and planarity G : 3-connected planar graph outer face fixed to convex polygon edges replaced by rubber bands Energy: Equilibrium: Tutte (1963)

8. G 3-connected planar rubber band embedding is planar Tutte (Easily) polynomial time computable Lifts to Steinitz representation Maxwell-Cremona

9. G=(V,E) : connected graph M=(M ij ) : symmetric V x V matrix M ii arbitrary M ij < 0, if ij  E 0, if weighted adjacency matrix of G G -matrix : eigenvalues of M WLOG

10. G planar, M G -matrix  corank of M is at most 3. Colin de Verdière Van der Holst G has a K 4 or K 2,3 minor   G -matrix M such that corank of M is 3. Colin de Verdière

11. Proof. (a) True for K 4 and K 2,3. (b) True for subdivisions of K 4 and K 2,3. (c) True for graphs containing subdivisions of K 4 and K 2,3. Induction needs stronger assumption!

12. transversal intersection M V x V symmetric matrices Strong Arnold property symmetric,  X=0

13. Representation of G in R 3 Nullspace representation basis of nullspace of M scaling M  scaling the u i

14. Van der Holst’s Lemma connected like convex polytopes? or…

15. Van der Holst’s Lemma, restated Let Mx=0. Then are connected, unless…

16. G 3-connected planar  nullspace representation can be scaled to convex polytope G 3-connected planar  nullspace representation, scaled to unit vectors, gives embedding in S 2 L-Schrijver

17. planar embedding nullspace representation

18. Stresses of tensegrity frameworks bars struts cables x y Equilibrium:

19. Cables Braced polyhedra Bars 0 stress-matrix

20. There is no non-zero stress on the edges of a convex polytope Cauchy Every braced polytope has a nowhere zero stress (canonically)

21. q p uv

22. The stress matrix of a nowhere 0 stress on a braced polytope has exactly one negative eigenvalue. The stress matrix of a any stress on a braced polytope has at most one negative eigenvalue. (conjectured by Connelly)

23. Proof: Given a 3-connected planar G, true for (a)for some Steinitz representation and the canonical stress; (b) every Steinitz representation and the canonical stress; (c) every Steinitz representation and every stress;

24. Problems 1.Find direct proof that the canonical stress matrix has only 1 negative eigenvalue 2.Directed analog of Steinitz Theorem recently proved by Klee and Mihalisin. Connection with eigensubspaces of non-symmetric matrices?

25. Let. Let span a components; let span b components. Then, unless… 3. Other eigenvalues? From another eigenvalue of the dodecahedron, we get the great star dodecahedron.

26. 4. 4-dimensional analogue? (Colin de Verdière number): maximum corank of a G -matrix with the Strong Arnold property  G planar  G is linklessly embedable in 3-space LL-Schrijver

27. Linklessly embeddable graphs homological, homotopical,… equivalent embeddable in R 3 without linked cycles Apex graph

28. Basic facts about linklessly embeddable graphs Closed under: - subdivision - minor - Δ-Y and Y- Δ transformations G linklessly embeddable  G has no minor in the “Petersen family” Robertson – Seymour - Thomas

29. The Petersen family (graphs arising from K 6 by Δ-Y and Y- Δ)

30. Can it be decided in P whether a given embedding is linkless? Can we construct in P a linkless embedding? Is there an embedding that can be certified to be linkless? Given a linklessly embedable graph…