Kőnig's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalization, in which the point in one fixed side of the graph of each edge is replaced by a subtree of a given tree. The proof uses a recent extension of Hall's theorem to families of hypergraphs, by the first author and P. Haxell . As an application we prove a special case (that of chordal graphs) of a conjecture of B. Reed.
Unable to display preview. Download preview PDF.