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 Bipa...  
Proof of Hall's Theorem:    • Proof: Hall's Marriage Theorem for Bi...  

Lesson on edge-induced subgraphs:    • What is an Edge-Induced Subgraph? | G...  

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:   / wrathofmathlessons  

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu  
● Facebook:   / wrathofmath  
● Twitter:   / wrathofmathedu  

My Music Channel:    / seanemusic