Topic: Bipartite Graphs and Konig's Theorem

Why Matching Size Never Exceeds Cover Size

Vertex Covers in Bipartite Graphs

Tracing Matching Augmentations by Hand

The König-Egerváry Identity for Bipartite Graphs

The Augmenting-Path Algorithm and Its Running Time

Symmetric Differences of Matchings

Matchings, Matching Number, and Saturated Vertices

Maximal and Maximum Matchings

Matching and Cover Certificates of Optimality

Kőnig’s Matching-Cover Theorem