Chapter 32: φ_Embedding — Planarity and Dimensional Collapse [ZFC-Provable] ✅

32.1 Graph Embedding in ZFC

Classical Statement: A graph is planar if it can be drawn in the plane without edge crossings. Kuratowski's theorem characterizes planar graphs by forbidden subgraphs: G is planar iff it contains no subdivision of $K_5$ or $K_{3,3}$.

Definition 32.1 (Planar Graph - ZFC):

• Planar embedding: Injective map V(G) → ℝ² with edges as curves
• No crossings: Edge curves intersect only at common endpoints
• Kuratowski subgraphs: $K_5$ (complete on 5 vertices), $K_{3,3}$ (complete bipartite 3×3)

Key Results:

• Euler's formula: v - e + f = 2 for connected planar graphs
• Four Color Theorem: χ(G) ≤ 4 for planar G
• Planar graphs have ≤ 3n - 6 edges (n ≥ 3)

32.2 CST Translation: Dimensional Collapse Constraints

In CST, planarity represents observer's ability to collapse graph structure to two dimensions without conflict:

Definition 32.2 (Planar Collapse - CST): A graph admits planar collapse if:

$$\exists \psi_2 : \psi_2 \circ P_G \downarrow \text{embedding in } \mathbb{R}^2 \text{ without crossings}$$

Two-dimensional observer can visualize entire structure.

Theorem 32.1 (Dimensional Obstruction Principle): Kuratowski subgraphs prevent two-dimensional collapse:

$$K_5 \text{ or } K_{3,3} \subseteq G \Rightarrow \neg(\psi_2 \circ P_G \downarrow \text{planar})$$

Proof: Topological necessity of crossings:

Stage 1: $K_5$ requires crossings:

$$5 \text{ vertices, each connected to } 4 \text{ others} \Rightarrow \text{crossing inevitable}$$

Stage 2: $K_{3,3}$ requires crossings:

$$\text{3×3 bipartite complete} \Rightarrow \text{Jordan curve theorem violation}$$

Stage 3: Subdivisions preserve non-planarity:

$$\text{Subdivision of non-planar} \Rightarrow \text{non-planar}$$

Stage 4: Self-reference through embedding:

$$\psi = \psi(\psi) \Rightarrow \text{observer recognizes dimensional limits}$$

Thus Kuratowski subgraphs obstruct planar collapse. ∎

32.3 Physical Verification: Circuit Board Design

Experimental Setup: Planarity manifests in physical systems requiring two-dimensional layout without interference.

Protocol φ_Embedding:

1. Design circuit/network requiring connections
2. Attempt two-dimensional layout
3. Identify crossing necessities
4. Verify Kuratowski obstruction if non-planar

Physical Principle: Two-dimensional embedding constraints appear in any layered physical system.

Verification Status: ✅ Experimentally Verified

Demonstrated through:

• Printed circuit board design
• VLSI chip layout
• Road network planning
• Utility line arrangement

32.4 The Embedding Mechanism

32.4.1 Planarity Testing

Linear time algorithm:

1. Find cycle C in G
2. Partition edges into "inside" and "outside" C
3. Recursively test subgraphs
4. Check for conflicts

32.4.2 Kuratowski Subgraphs

$$K_5 : \text{all } \binom{5}{2} = 10 \text{ edges}$$ $$K_{3,3} : \text{all } 3 \times 3 = 9 \text{ edges between parts}$$

32.4.3 Wagner's Theorem

G is planar iff no $K_5$ or $K_{3,3}$ minor.

32.5 Properties of Planar Graphs

32.5.1 Euler's Formula

For connected planar graph with v vertices, e edges, f faces:

$$v - e + f = 2$$

32.5.2 Edge Bound

$$e \leq 3v - 6 \text{ for } v \geq 3$$

32.5.3 Dual Graph

Each planar graph has dual with faces ↔ vertices.

32.6 Connections to Other Collapses

Embedding relates to:

• GraphColoring (Chapter 26): Four colors suffice for planar
• Flow (Chapter 31): Planar network flow
• Hadwiger (Chapter 28): Hadwiger number ≤ 4 for planar
• TreeDecomposition (Chapter 29): Planar graphs have O(√n) treewidth

32.7 Generalizations

32.7.1 Surface Embedding

Graph genus g: minimum genus surface for embedding.

$$\chi \leq \lfloor \frac{7 + \sqrt{1 + 48g}}{2} \rfloor$$

32.7.2 Book Embedding

Pages in book, edges on pages, vertices on spine.

32.7.3 Crossing Number

$$\text{cr}(G) = \min \text{ crossings in any drawing}$$

32.8 Physical Realizations

32.8.1 Circuit Boards

1. Components as vertices
2. Connections as edges
3. Layers for non-planar
4. Via holes between layers

32.8.2 Transportation Networks

1. Intersections as vertices
2. Roads as edges
3. Overpasses for crossings
4. Planar where possible

32.8.3 Molecular Structure

1. Atoms as vertices
2. Bonds as edges
3. 3D when non-planar
4. Planar substructures

32.9 Algorithms

32.9.1 Hopcroft-Tarjan

O(n) planarity testing via DFS.

32.9.2 PQ-Trees

Data structure for planarity.

32.9.3 SPQR-Trees

Decomposition for planar graphs.

32.10 Forbidden Minors

32.10.1 For Surfaces

Finite obstruction set for each surface.

32.10.2 Robertson-Seymour

Every minor-closed property has finite obstruction set.

32.10.3 Explicit Sets

Known for torus, projective plane, etc.

32.11 Drawing Algorithms

32.11.1 Straight-Line

Every planar graph has straight-line embedding.

32.11.2 Orthogonal

Edges as horizontal/vertical segments.

32.11.3 Force-Directed

Physical simulation for aesthetic layout.

32.12 Thickness and Layers

32.12.1 Thickness

$$\theta(G) = \min \text{ planar subgraphs covering } E(G)$$

32.12.2 Complete Graphs

$$\theta(K_n) = \lceil \frac{n(n-1)}{6(n-2)} \rceil$$

32.12.3 Applications

Multi-layer circuit board design.

32.13 Modern Developments

32.13.1 1-Planarity

Graphs drawable with ≤ 1 crossing per edge.

32.13.2 Minor-Closed Properties

Characterization by forbidden minors.

32.13.3 Computational Topology

Embedding in higher dimensions.

32.14 The Embedding Echo

The pattern ψ = ψ(ψ) reverberates through:

• Dimensional echo: higher structure forces higher dimension
• Obstruction echo: Kuratowski subgraphs block planarity
• Duality echo: faces and vertices interchange

This creates the "Embedding Echo" - the resonance between graph structure and dimensional requirements.

32.15 Synthesis

The embedding collapse φ_Embedding reveals the fundamental tension between structural complexity and dimensional constraints. Planarity is not just about drawing but about whether a relational structure can exist in two dimensions without conflict. Kuratowski's theorem provides the precise obstruction: $K_5$ and $K_{3,3}$ are the minimal non-planar structures.

The physical verification through circuit design, road networks, and molecular structures shows this is a universal principle. Any system of connections faces the same constraint: can it be realized in the available dimensions? The need for circuit board layers, highway overpasses, and three-dimensional molecular conformations all stem from non-planarity.

Most beautifully, the self-referential ψ = ψ(ψ) manifests as: observer in two dimensions cannot collapse certain structures without seeing crossings. The dimension of observation limits what can be perceived without conflict. This is why we need higher dimensions - not as mathematical abstraction but as necessary space for complexity to unfold. In graph embedding, mathematics discovers the price of dimensional limitation: some patterns simply cannot fit in lower dimensions.

---

"In every embedding, observer learns the truth of dimension: complexity has shape, and shape needs space. What cannot lie flat must rise, finding freedom in higher dimensions."