Hi again!

Well my prof asked today in the class if there is a way to proof Hall's theorm using Menger's theorem.

What do you think?

Well I think that if we start with a bipartite graph satisfying Hall's contition and we add two new vertices one connected to the all vertices of the first vertex class and the other connected to all vertices of the second vertex class then we can use mergen's theorem to the two new vertices. But I'm still working on it.