Sign inSign in
ConceptMathematics

König's theorem

A theorem stating that in any bipartite graph, the size of a maximum matching is equal to the size of a minimum vertex cover.
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.

Lecturers

1
  • Peter Shor

    MIT · Undergraduate

Connections

6

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

Concepts4

Lectures2

1 lecturer. 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.