TOPICS
Search

Hall's Condition


Given a set A, let N(A) be the set of neighbors of A. Then the bipartite graph G with bipartitions X and Y has a perfect matching iff |N(A)|>=|A| for all subsets A of X.


See also

Diversity Condition, Hall's Theorem, Marriage Theorem, Perfect Matching

This entry contributed by Chris Heckman

Explore with Wolfram|Alpha

References

Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.

Referenced on Wolfram|Alpha

Hall's Condition

Cite this as:

Heckman, Chris. "Hall's Condition." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/HallsCondition.html

Subject classifications