LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Lecture 12: Matching
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Lecture 12: Matching

82 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 12

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.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 22 m
Compared with MathematicsLonger than 87%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 10 of 2212 h 1 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN
Relations and Counting

Relations and Counting

MIT · 79 MIN