Просмотр кода страницы Menger's theorem

'''Menger's theorem''' --- теорема Менгера. 

'''1.''' (An edge-form of the theorem). Let <math>G</math> be an unoriented graph with two
distinguished vertices <math>s</math> and <math>t</math>. The maximum number of
edge-disjoint paths joining <math>s</math> and <math>t</math> is equal to the minimum number
of edges in a cut separating <math>s</math> and <math>t</math>.

'''2.''' (A vertex-form of the theorem). The minimum number of vertices separating two
nonadjacent nodes <math>s</math> and <math>t</math> is equal to the maximum number of vertex
disjoint <math>s - t</math> paths.