Proof by Contradiction Using Hall's Marriage Theorem (Playing Cards)

This video provides a proof by contradiction using Hall's Marriage theorem. The video proves if you deal 52 playing cards into 13 piles of 4, you can always select one card from each pile to get one each of the 13 card values.
mathispower4u.com

[@brockobama257]

Thank you. I have many homework problems like this but the lectures only go over proofs of theorems and proving abstract truths about bipartite graphs. Maybe I'm dumb because I can't do my homework. But I don't care. My professor hadn't gone over applying this theorem then gave us homework on it. SO THANK YOU.