König-Egerváry theory

König-Egerváry theory

[¦kərn·ik ′e·ger‚vär·yi ‚thir·əm] (mathematics) The theorem that, for a matrix in which each entry is either 0 or 1, the largest number of 1's that can be chosen so that no two selected 1's lie in the same row or column equals the smallest number of rows and columns that must be deleted to eliminate all the 1's.