On a possible extension of Hall's theorem to bipartite hypergraphs

DOI10.1016/0012-365X(90)90136-6zbMath0714.05047WikidataQ126529740 ScholiaQ126529740MaRDI QIDQ750464

Ron Aharoni, Ofra Kessler

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hall's theorembipartite hypergraphfractional version

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ A condition for matchability in hypergraphs ⋮ Almost perfect matchings in random uniform hypergraphs ⋮ On a criterion for matchability in hypergraphs ⋮ Multiset combinatorial batch codes ⋮ A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs

Cites Work

• Maximum degree and fractional matchings in uniform hypergraphs
• Matchings in n-partite n-graphs
• On Representatives of Subsets

This page was built for publication: On a possible extension of Hall's theorem to bipartite hypergraphs