Proof: Regular Bipartite Graph has a Perfect Matching | Graph Theory

Описание: Support the production of this course by joining Wrath of Math to access all my graph theory videos!
   / @wrathofmath  
🛍 Check out the coolest math clothes in the world: https://mathshion.com/

Graph Theory course:    • Graph Theory  
Graph Theory exercises:    • Graph Theory Exercises  

Get the textbook! https://amzn.to/3HvI535

An r-regular bipartite graph, with r at least 1, will always have a perfect matching. We prove this result about bipartite matchings in today's graph theory video lesson using Hall's marriage theorem for bipartite matchings. Recall that a perfect matching is a matching that covers every vertex of a graph.

Proof that a Regular Bipartite Graph is Balanced:    • Proof: Regular Bipartite Graph is Balanced...  
Matchings, Perfect Matchings, Maximum Matchings, and More:    • Matchings, Perfect Matchings, Maximum Matc...  
Hall's Theorem and Condition for Bipartite Matchings:    • Hall's Theorem and Condition for Bipartite...  
Proof of Hall's Marriage Theorem:    • Proof: Hall's Marriage Theorem for Biparti...  

★DONATE★
◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits:   / wrathofmathlessons  
◆ Donate on PayPal: https://www.paypal.me/wrathofmath

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu  
● Facebook:   / wrathofmath  
● Twitter:   / wrathofmathedu