Matchings in n-partite n-graphs

DOI10.1007/BF02582958zbMATH Open0614.05042OpenAlexW2331705423MaRDI QIDQ1820172FDOQ1820172

Authors Ron Aharoni 

Publication date 1985

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

Full work available at URL https://doi.org/10.1007/bf02582958

zbMATH Keywords

fractional matching

Mathematics Subject Classification ID

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

Recommendations

• On a criterion for matchability in hypergraphs
• Rainbow fractional matchings
• On the fractional matching polytope of a hypergraph
• A condition for matchability in hypergraphs
• Maximum size of a graph with given fractional matching number

Cited in

(9)

• Title not available (Why is no real title available?)
• On the fractional matching polytope of a hypergraph
• On a criterion for matchability in hypergraphs
• On a possible extension of Hall's theorem to bipartite hypergraphs
• Hall's theorem for hypergraphs
• A condition for matchability in hypergraphs
• Matchings and covers in hypergraphs
• A generalization of Hall's theorem for \(k\)-uniform \(k\)-partite hypergraphs
• Maximum size of a graph with given fractional matching number

This page was built for publication: Matchings in n-partite n-graphs

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