Matchings in n-partite n-graphs

DOI10.1007/BF02582958zbMath0614.05042OpenAlexW2331705423MaRDI QIDQ1820172

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)

Related Items (6)

A condition for matchability in hypergraphs ⋮ On a criterion for matchability in hypergraphs ⋮ Hall's theorem for hypergraphs ⋮ A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs ⋮ On a possible extension of Hall's theorem to bipartite hypergraphs ⋮ Matchings and covers in hypergraphs

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