An interesting problem with cards, marriages, and graphs: Hall's Marriage Theorem

Graph theory can crop even where you don't expect it to! Let's play a simple bet on a card game, and let's see how we can codify the problem into a bipartite graph, and why this might be useful. It will let us use one of the central results of graph theory from the XX century, Hall's Marriage theorem. What does marriage have to do with card games and graph theory? Well, you're about to find out!

More about me: 👉 https://linktr.ee/erik_hormann
Let's connect: 👉   / erik_hormann  

Please let me know what you think of my videos in the #commentsection 👇 and #like 👍 #subscribe ▶️ and ring the #bell 🔔 to stay up-to-date with all the videos I release! Feel free to ask me any #question ⁉️

00:00 Intro
02:01 The Marriage Problem
05:50 Hall's Marriage Theorem
08:25 Game Solution!
11:20 Outro