Abstract
We generalize Hall's condition for the existence of a perfect matching in a bipartite graph, to balanced hypergraphs.
Similar content being viewed by others
References
C. Berge: Sur certains hypergraphes generalisant les graphes bipartites in:Combinatorial Theory and its Applications I, (P. Erdős, A. Rényi and V. Sós eds.), Colloq. Math. Soc. János Bolyai 4, North Holland, Amsterdam (1970) 119–133.
C. Berge:Hypergraphs, North Holland (1989).
C. Berge, andM. Las Vergnas: Sur un théorème du type König pour les hypergraphes, Annals of the New York Academy of Sciences 175 (1970), 32–40.
M. Conforti, andG. Cornuejols: Balanced 0,±1 matrices, bicoloring and total dual integrality,Mathematical Programming,71 (1995), 249–258.
D. R. Fulkerson, A. Hoffman, andR. Oppenheim: On balanced matrices,Mathematical Programming Study,1 (1974), 120–132.
P. Hall: On representatives of subsets,J. London Math. Soc. (1935), 26–30.
Author information
Authors and Affiliations
Additional information
This work was partially supported in part by NSF grants DMI-9424348, DMS-9509581 and ONR grant N00014-89-J-1063. Ajai Kapoor was also supported by a grant from Gruppo Nazionale Delle Riccerche-CNR. Finally, we acknowledge the support of Laboratiore ARTEMIS, Université Joseph Fourier, Grenoble.