A tree version of Konig's theorem

Ron Aharoni, Eli Berger, Ran Ziv

Konig's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalisation of this result, in which each point in one side of…