Some background. Via. A longer but non-free video.
One of Oded Schramm's less-well-known but better-named results is his "monster packing theorem", a far-reaching generalization of the famous circle packing theorem of Koebe, Andreev, and Thurston.
Here, a packing is a set of geometric shapes with disjoint interiors, whose intersection graph represents a given planar graph. For instance, the circle packing theorem states that every planar graph can be represented as the intersection graph of interior-disjoint circles. But what if we want to