A condition for matchability in hypergraphs
- Cite this article as:
- Haxell, P.E. Graphs and Combinatorics (1995) 11: 245. doi:10.1007/BF01793010
- 421 Downloads
An extension of Hall's theorem is proved, which gives a condition for complete matchings in a certain class of hypergraphs.
Download to read the full article text
© Springer-Verlag 1995