πŸŽ“How I Study AIHISA
πŸ“–Read
πŸ“„PapersπŸ“°Blogs🎬Courses
πŸ’‘Learn
πŸ›€οΈPathsπŸ“šTopicsπŸ’‘Concepts🎴Shorts
🎯Practice
🧩Problems🎯Prompts🧠Review
Search

Concepts1

Category

πŸ”·Allβˆ‘Mathβš™οΈAlgoπŸ—‚οΈDSπŸ“šTheory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#lp duality
βš™οΈAlgorithmIntermediate

KΓΆnig's Theorem

KΓΆnig's Theorem states that in any bipartite graph, the size of a maximum matching equals the size of a minimum vertex cover.

#konig's theorem#bipartite matching#minimum vertex cover+12