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: https://www.youtube.com/watch?v=Ihr6gMx7b9c
Proof of Hall’s Theorem: https://www.youtube.com/watch?v=4tu-H4ES0fk
Lesson on edge-induced subgraphs: https://www.youtube.com/watch?v=bk08JzEWeC4
I hope you find this video helpful, and be sure to ask any questions down in the comments!
+WRATH OF MATH+
◆ Support Wrath of Math on Patreon: https://www.patreon.com/wrathofmathlessons
Follow Wrath of Math on…
● Instagram: https://www.instagram.com/wrathofmathedu
● Facebook: https://www.facebook.com/WrathofMath
● Twitter: https://twitter.com/wrathofmathedu
My Music Channel: http://www.youtube.com/seanemusic