Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

Menger's theorem

The maximum number of vertex-disjoint routes between two points equals the fewest vertices needed to block every route between them.

Menger's theorem: for non-adjacent $u,v$ , the maximum number of pairwise internally vertex-disjoint $u$ – $v$ paths equals the minimum size of a $u$ – $v$ vertex cut (theorem: mengers-theorem).

See also

vertex connectivity and edge connectivity

Read the full section →

snap pen only

Graph settings

indep dep deg

grid intersections

xmin xmax ymin ymax

x-tick y-tick

Calculator