On a criterion for matchability in hypergraphs

DOI10.1007/BF02988309zbMATH Open0781.05035MaRDI QIDQ687713FDOQ687713

Authors: Ron Aharoni 

Publication date: 28 October 1993

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

Recommendations

• Matchings in n-partite n-graphs
• On the fractional matching polytope of a hypergraph
• Perfect matchings in balanced hypergraphs---a combinatorial approach
• On a possible extension of Hall's theorem to bipartite hypergraphs
• A condition for matchability in hypergraphs

zbMATH Keywords

hypergraphfractional matching numbermatchability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• On the fractional matching polytope of a hypergraph
• On a possible extension of Hall's theorem to bipartite hypergraphs
• A geometric theory for hypergraph matching
• Matchings in n-partite n-graphs
• Matching orderable and separable hypergraphs
• Matching critical intersection hypergraphs
• A condition for matchability in hypergraphs
• A generalization of Hall's theorem for \(k\)-uniform \(k\)-partite hypergraphs
• Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
• Maximum size of a graph with given fractional matching number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687713)