KnowraMenger's theoremLinked fromLinked fromThe 8 pages that link to Menger's theorem, each with the reason it gives.All 8Related 6Compared with 2Path (graph theory)Related: It uses collections of paths to quantify how robustly vertices are connected.Connected graphRelated: It gives a precise relationship between alternate paths and vulnerability to cuts.Ford–Fulkerson algorithmRelated: Its path-and-separator duality parallels the flow-and-cut certificate.Max-flow min-cut theoremRelated: It is a path-and-separator counterpart of the flow-and-cut equality.Balinski's theoremRelated: It expresses connectivity through disjoint paths, a useful perspective on Balinski's bound.Robbins' theoremRelated: Its directed form characterizes strong connectivity through paths between every ordered vertex pair.