Sign inSign in

Perfect matching

A matching in a graph where every vertex is incident to exactly one edge of the matching.
as Amartya Shankha Biswas defines itMITThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Tom Leighton

    MIT · Undergraduate

    A matching is perfect if its size is equal to half the number of nodes in the graph.
    • 5:05Matching Problems
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A set of edges in a bipartite graph such that every vertex is incident to exactly one edge in the set.
    • 57:24The Complexity Class coNP

Lectures that assume it

1

Connections

13

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.