Göring, Frank A proof of Menger’s theorem by contraction. (English) Zbl 1017.05065 Discuss. Math., Graph Theory 22, No. 1, 111-112 (2002). The author gives a very short proof of the classical Menger theorem concerning the number of disjoint \(AB\)-paths of a finite graph for two subsets \(A\) and \(B\) of its vertex set. Reviewer: F.Gliviak (Bratislava) Cited in 1 Document MSC: 05C40 Connectivity Keywords:connectivity; Menger theorem; disjoint paths PDFBibTeX XMLCite \textit{F. Göring}, Discuss. Math., Graph Theory 22, No. 1, 111--112 (2002; Zbl 1017.05065) Full Text: DOI Link