Last week I attended the Graph Drawing conference in the wonderful city of Bordeaux, France. The conference was smoothly organized, they had sensational food and we had 30°C sunny weather. All lunches and the conference dinner were organized as buffets without seating. I enjoyed this very much, since I was able to meet much more people than in the usual setting. So thanks a lot for the organizers for hosting a great conference.
One of the main area of research are grid embeddings of convex 3d polytopes. By Steinitz' theorem every 3-connected planar graph can be embedded as a convex 3d polytope, even with integer coordinates. The question is, how large have the coordinates to be, in terms of the number of the vertices . Although there were a series of improvements over the grid size of Steinitz' construction (of course he was not interested in getting integer or even small coordinates) the current best algorithm uses coordinates of size . At least for triangulations (simplicial polytopes) I expect however that the necessary grid size is bounded by a polynomial. In fact, the current lower bound is only .
This post is about embedding a very special graph as a convex 3d polytope: the graph of the dodecahedron. In other words, what is the smallest grid in which one can embed a (nonregular) dodecahedron. The dodecahedron is interesting since it is the smallest example with no triangular and quadrilateral faces. This seems to be a more tricky case, at least for the current best algorithm that would embed the dodecahedron on the grid with z-coordinates ranging between zero and 11 083 163 098 782 678 334 820 352. Of course we can do better. Francisco Santos found an embedding that fits inside the 8 x 6 x 4 grid. Also, there is a very symmetric realization known as pyritohedron that needs a 12 x 12 x 12 grid.