Abstract
The standard conditions in Hall's perfect matching theorem for a bipartite graph G require that all subsets from one side of G are expanding. The unbiased extension identifies mixtures of subsets from both sides such that their expansions imply the standard conditions—hence a perfect matching.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have