Proposition 4.3 Hall’s Marriage Theorem Let G=(A,B,E) be any bipartite graph such that |A|=|B|. If |NG(S)|≥|S| for every subset S⊆A, then G has a perfect matching. Proof of Proposition 4.2 Let G=(A,B,E) be a graph drawn from G(m,m,q). From Proposition 4.3, the...