Prove that every bipartite graph G has a matching of size ≥ |E(G)|/∆, where ∆ is the maximum degree of G.

56 Views Asked by At

Prove that every bipartite graph G has a matching of size ≥ |E(G)|/∆, where ∆ is the maximum degree of G. Using Halls Theorem. I need a good proof, I am studying for an exam and I need to understand very deeply.