König's theorem


Also found in: Wikipedia.

König's theorem

[′kər·nigz ‚thir·əm]
(mathematics)
The theorem that the largest possible number of edges in a matching of a bipartite graph equals the smallest possible number of edges in an edge cover of that graph.