A minimum edge cover is a smallest set of edges such that every vertex is incident to at least one edge. In a bipartite graph with no isolated vertices, minimum edge cover size equals .
To construct it: start with the max matching edges, then add arbitrary edges to cover the remaining unmatched vertices. This is useful in problems requiring all items to be covered by pairs or connections.