hypergraphsSperner's LemmaWe prove a hypergraph version of Hall's theorem. The proof is topological. 2000 John Wiley & Sons, Inc. J Graph Theory 35: 83–88, 2000doi:10.1002/1097-0118(200010)35:23.0.CO;2-VRon AharoniPenny HaxellJohn Wiley & Sons, LtdJournal of Graph Theory...
Dilworth's theorem. 尤其是 Dilworth定理⇔Hall定理⇔König–Egerváry定理⇔König定理。 A generalization of Hall's theorem to general graphs (that are not necessarily bipartite) is provided by the Tutte theorem. A generalization of Hall's theorem to bipartite hypergraphs is provided by variou...
Aharoni, R., Haxell, P. (2000) Hall’s theorem for hypergraphs. J. of Graph Theory 35: pp. 83-88Aharoni R., Haxell P.: Hall’s theorem for hypergraphs. J. Graph Theory 11 , 83–88 (2000)Aharoni, R., Haxell, P.: Hall’s theorem for hypergraphs. Journal of Graph Theory 35...
Aharoni
doi:10.22108/TOC.2019.105022.1506Reza Jafarpour GolzariUniversity of Isfahan
MatchingHall’s theoremKőnig’s theoremNormal hypergraphWe investigate the relation between Hall's theoremdoi:10.1016/j.disc.2018.06.013Beckenbach IsabelBornd?rfer RalfDiscrete Mathematics
One of possible interpretations of the well-known K枚nig-Hall-Egerv谩ry theorem is a full characterization of all bipartite graphs extremal for fractional matchings of a given weight (or, equivalently, a characterization of $(0,1)$-matrices extremal for partial fractional diagonals of a given ...