
Lecture 12: Matching
Zachary Abel teaches this MIT 6.1200J Mathematics for Computer Science lecture on graph matchings. He defines a matching as a subgraph in which every vertex has degree one, then works through the major problem types built on that idea: maximum weight matching, stable matching, and matching in both bipartite and non-bipartite graphs. The lecture develops the theory needed to analyze when matchings exist and how to find optimal ones, connecting combinatorial structure to algorithmic approaches. As part of MIT's OpenCourseWare series, it runs at the pace of an actual semester lecture, with Abel working through definitions and examples on the board rather than delivering a polished studio talk. Useful for students building up discrete math and algorithms foundations, particularly those encountering stable matching or bipartite graph theory for the first time.