A tree version of Konig's theorem

Simple item page
dc.creatorAharoni, Ron
dc.creatorBerger, Eli
dc.creatorZiv, Ran
dc.date1999-12-16
dc.date2000-01-10
dc.date.accessioned2026-07-07T05:32:19Z
dc.date.available2026-07-07T05:32:19Z
dc.descriptionKonig'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 the graph 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.
dc.description6 pages, no figures. Submitted to Combinatorica. Minor mistakes in the proofs in v1 were corrected
dc.identifierhttps://arxiv.org/abs/math/9912134
dc.identifierhttp://arxiv.org/abs/math/9912134
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/79622
dc.subjectCombinatorics
dc.titleA tree version of Konig's theorem
dc.typetext

Files

Collections

arXiv