Ramanujan, M.S.
(The Institute of Mathematical Sciences, 2013)
Menger's theorem, which states that the minimum number of vertices whose removal disconnects two vertices s and t in a graph is equal to the maximum number of pairwise vertex disjoint paths from s to t in the graph, is an ...