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

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 Bal...  
Matchings, Perfect Matchings, Maximum Matchings, and More:    • Matchings, Perfect Matchings, Maximum...  
Hall's Theorem and Condition for Bipartite Matchings:    • Hall's Theorem and Condition for Bipa...  
Proof of Hall's Marriage Theorem:    • Proof: Hall's Marriage Theorem for Bi...  

★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

Thanks to Robert Rennie and Barbara Sharrock for their generous support on Patreon!

Thanks to Crayon Angel, my favorite musician in the world, who upon my request gave me permission to use his music in my math lessons: https://crayonangel.bandcamp.com/

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

My Music Channel:    / @emery3050