Can we assign everyone a job? (maximum matchings) | Bipartite Matchings

[@OptWhiz]

Hey everyone, I made a video earlier on this topic, but looking at it again, I felt it was incomplete, so I decided to re-edit it and make it more concise. If you saw the previous video, it’s mostly the same content, though I did add more details on how to find augmenting paths using breadth-first search. I have a new video coming soon on weighted bipartite matchings… stay tuned!

[@BirilliantSkyStar]

Your videos are fantastic!

[@XyndraNerd]

k-partite please

[@oscarbraun6825]

This is an incredible video!! Thank you so much, absolutely a life saver

[@alfredoosorio2599]

The explanation was very clear, and I appreciated the effort put into the animations.

[@zhanchen8107]

Hi, very nice video for startups. How can I find the proof of the mentioned theorems? And what about the sizes of "applicants" and "jobs" sets are not the same?

[@zivenrokhit2141]

This was a spectacular video. I'm currently studying for a graph theory course as a math major and this video perfectly explains alot of the concepts in my course.

[@killerthoughts6150]

wow you nailed it man, this should be a tutorial on how to make a tutorial, gold standard. The explanation, the pace, the background music, the visual aid everything is just perfect! The only question left is, while you are at maximizing job matching, can you assign me to a job at google? :p

[@onurbaran4016]

Wonderful video. Greetings from Türkiye.

[@conghoannguyen446]

thank you ! Really useful and what is the software are you using to make intuitive explanation video like this? I really want to use it for my students. Please share with me. Thanks in advance

[@Akarom927]

thank you ! Relly helpful,i is much more clear than what is taught on our lessons

[@jadecook1960]

Great video! Would love for you to explain why Berge's Theorem is true, that was my only concern. Very great video!

[@georget2063]

one direction is trivial. For the other one, you assume you have a non-maximum matching M with no augmenting path. Pick any maximum matching M'. Consider the edge-induced subgraph induced by the symmetric difference of the edge sets of the matchings. In that graph, all vertices have degree

[@bobernhardsson5345]

At 0:52 Cathy didnt get any job?

[@danielnderitu5886]

Learnt a lot, thanks.

[@weilynchong9507]

Favorite video so far!

[@ShakrinJahanMozumder]

Thanks!

[@ajdjdhdhshahmajaj]

Excellent video. Love form Pakistan