  The Known Menger's theorem states that in a finite graph, the size of a
minimum separator set of any pair of vertices is equal to the maximum number of
disjoint paths that can be found between these two vertices. In this paper, we
study the minimal separators of two non-adjacent vertices in a finite graph,
and we give a new elementary proof of Menger's theorem.
