A Tree Version of Kőnig's Theorem
暂无分享,去创建一个
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 [2]. As an application we prove a special case (that of chordal graphs) of a conjecture of B. Reed.
[1] Gábor Tardos. Transversals of 2-intervals, a topological approach , 1995, Comb..
[2] Tomás Kaiser. Transversals of d-Intervals , 1997, Discret. Comput. Geom..
[3] Bruce Reed. The list colouring constants , 1999 .
[4] Ron Aharoni,et al. Hall's theorem for hypergraphs , 2000 .