Question: Verify Menger's Theorem, Theorem, for the planar graph of the cube with s and t as shown.
Theorem: The maximum number of edge disjoint paths between two vertices s and t in a graph is the minimum number of edges whose removal leaves no path between s and t.