Geodesic
A proof of menger's theorem by contraction
Discussiones Mathematicae. Graph Theory, Tome 22 (2002) no. 1, pp. 111-112

Voir la notice de l'article provenant de la source Library of Science

A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a finite graph for two subsets A and B of its vertex set is given. The main idea of the proof is to contract an edge of the graph.
Keywords: connectivity, disjoint paths, digraph, Menger 
@article{DMGT_2002_22_1_a8,
     author = {G\"oring, Frank},
     title = {A proof of menger's theorem by contraction},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {111--112},
     publisher = {mathdoc},
     volume = {22},
     number = {1},
     year = {2002},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2002_22_1_a8/}
}
TY  - JOUR
AU  - Göring, Frank
TI  - A proof of menger's theorem by contraction
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2002
SP  - 111
EP  - 112
VL  - 22
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2002_22_1_a8/
LA  - en
ID  - DMGT_2002_22_1_a8
ER  - 
%0 Journal Article
%A Göring, Frank
%T A proof of menger's theorem by contraction
%J Discussiones Mathematicae. Graph Theory
%D 2002
%P 111-112
%V 22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2002_22_1_a8/
%G en
%F DMGT_2002_22_1_a8
Göring, Frank. A proof of menger's theorem by contraction. Discussiones Mathematicae. Graph Theory, Tome 22 (2002) no. 1, pp. 111-112. http://geodesic.mathdoc.fr/item/DMGT_2002_22_1_a8/