The Graphs of Planar Soap Bubbles

We characterize the graphs formed by two-dimensional soap bubbles as being exactly the 3-regular bridgeless planar multigraphs. Our characterization combines a local characterization of soap bubble graphs in terms of the curvatures of arcs meeting at common vertices, a proof that this characterization remains invariant under Moebius transformations, an application of Moebius invariance to prove bridgelessness, and a Moebius-invariant power diagram of circles previously developed by the author for its applications in graph drawing.

💡 Research Summary

The paper provides a complete mathematical characterization of the planar graphs that can be realized as two‑dimensional soap‑bubble configurations. Starting from the physical observation that soap films are minimal surfaces and that three films meeting at a point always do so at 120° (Plateau’s law), the author translates these geometric constraints into graph‑theoretic language. A “soap‑bubble graph” is defined as a planar multigraph whose vertices correspond to junctions of films and whose edges are arcs of circles (or straight lines) with constant curvature. At every vertex exactly three edges meet, the incident angles are all 120°, and the signed curvatures (inverse radii, positive for arcs bulging outward, negative for arcs bulging inward) satisfy a local balance equation. This local condition is called the 3‑regular curvature‑balanced property.

The first major contribution is the proof that this definition is invariant under the full Möbius group (inversions, rotations, translations, and dilations). Möbius transformations map circles to circles and preserve the signed curvature up to a simple rational factor, while also preserving the 120° angle condition. Consequently, the class of soap‑bubble graphs is closed under any Möbius map, which is a powerful geometric symmetry not present in ordinary planar graph theory.

Using this invariance, the author shows that a soap‑bubble graph cannot contain a bridge (an edge whose removal disconnects the graph). The argument proceeds by assuming a bridge exists, applying a Möbius transformation that sends one endpoint of the bridge arbitrarily far away, and observing that the curvature balance at the far‑away vertex would force the curvature of the bridge to tend to zero while still having to meet the 120° angle condition—an impossibility. Hence every soap‑bubble graph is necessarily bridgeless.

The second major technical tool is the Möbius‑invariant power diagram of circles, previously introduced by the author for graph‑drawing applications. By assigning a weight to each circle (related to its curvature) and constructing the power diagram, one obtains a planar subdivision whose edges are exactly the power bisectors between circles. These bisectors are either straight lines or circular arcs that coincide with the arcs required by the soap‑bubble representation. The paper proves that for any 3‑regular bridgeless planar multigraph there exists a set of circles whose power diagram reproduces the graph’s embedding. This establishes a constructive existence proof: not only are the two classes equivalent, but there is an explicit algorithmic method to realize any such graph as a soap‑bubble configuration.

Putting the pieces together, the main theorem states that the family of planar graphs realizable by soap bubbles is precisely the family of 3‑regular, bridgeless planar multigraphs. The paper supplies both a local geometric characterization (curvature balance at vertices) and a global topological characterization (absence of bridges), and it bridges the gap between physical minimal‑surface phenomena and combinatorial graph theory via Möbius geometry.

Beyond the core theorem, the author discusses several implications. First, the result offers a new perspective on classic graph‑drawing problems: any 3‑regular bridgeless planar graph can be drawn with edges as circular arcs meeting at exact 120° angles, which may be aesthetically pleasing and physically realizable in soap‑film experiments. Second, the Möbius‑invariant power diagram provides a computational pipeline: given a target graph, one can solve a system of curvature equations to obtain a suitable circle set, then compute the power diagram to obtain the embedding. Third, the work suggests extensions to higher‑dimensional analogues (e.g., foam structures in three dimensions) where curvature balance and Möbius invariance might play analogous roles.

In summary, the paper unifies physical intuition about soap bubbles with rigorous combinatorial classification, introduces Möbius‑invariant tools to prove bridgelessness and construct embeddings, and opens avenues for both theoretical exploration and practical visualization of planar graphs.