Matchings, Perfect Matchings, Maximum Matchings, and More! | Independent Edge Sets, Graph Theory

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: Proof of Hall’s Theorem: Lesson on edge-induced subgraphs: 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: Follow Wrath of Math on... ● Instagram: ● Facebook: ● Twitter: My Music Channel: http://w