The journal
Open the journal →The conversation starts in the journal — be the first to post.
About Menger's theorem
In the mathematical discipline of graph theory, Menger's theorem says that in a finite graph, the size of a minimum cut set is equal to the maximum number of disjoint paths that can be found between any pair of vertices.
Everything about Menger's theorem →