Matchings in n-partite n-graphs
From MaRDI portal
Publication:1820172
DOI10.1007/BF02582958zbMath0614.05042OpenAlexW2331705423MaRDI QIDQ1820172
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02582958
Related Items
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
