Using Konig Egervary theorem for m x n matrices, how can I deduce Hall's theorem? My book says that it's actually bidirectional but I only have to show that Konig theorem implies Hall's theorem. I don't know any graph theory other than our brief discussion of bipartite graphs.
The hint says to construct a matrix with entries "0" if the ith element is in the jth set, and 1 otherwise.