On a criterion for matchability in hypergraphs

DOI10.1007/BF02988309zbMath0781.05035MaRDI QIDQ687713

Ron Aharoni

Publication date: 28 October 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypergraphfractional matching numbermatchability

Mathematics Subject Classification ID

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

Related Items (2)

A condition for matchability in hypergraphs ⋮ A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs

Cites Work

• On a possible extension of Hall's theorem to bipartite hypergraphs
• Matchings in n-partite n-graphs

This page was built for publication: On a criterion for matchability in hypergraphs