Matchings, Perfect Matchings, Maximum Matchings, and More! | 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 What are matchings, perfect matchings, complete matchings, maximal matchings, maximum matchings, and independent edge sets in graph theory? We'll be answering that great number of questions in today's graph theory video lesson! A matching in a graph is a set of edges with no common end-vertices. Halls' Theorem and Condition: • Hall's Theorem and Condition for Bipartite... Proof of Hall's Theorem: • Proof: Hall's Marriage Theorem for Biparti... ◆ Support Wrath of Math on Patreon: / wrathofmathlessons Follow Wrath of Math on... ● Instagram: / wrathofmathedu ● Facebook: / wrathofmath ● Twitter: / wrathofmathedu
Hall's Theorem and Condition for Bipartite Matchings | Graph Theory
Proof: Hall's Marriage Theorem for Bipartite Matchings | Graph Theory
What are Planar Graphs? | Graph Theory
Matching and Covering
Hamiltonian Cycles, Graphs, and Paths | Hamilton Cycles, Graph Theory
How do we OPTIMALLY assign drivers to riders? (Hungarian Algorithm) | Bipartite Matchings
A Breakthrough in Graph Theory - Numberphile
Unweighted Bipartite Matching | Network Flow | Graph Theory
Intro to Directed Graphs | Digraph Theory
2.11.1 Stable Matching: Video
Hopcroft–Karp algorithm
Can we assign everyone a job? (maximum matchings) | Bipartite Matchings
Why Do Sporadic Groups Exist?
Hall's Theorem - 33
Existence of Graphs with High Girth and High Chromatic Number
Lecture #9: How to Read so that you *Retain* Information
The Oldest Unsolved Problem in Math
This random graph fact will blow your mind | Rado graph and its godlike properties
William Dunham, A tribute to Euler
