A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs

DOI10.22108/toc.2019.105022.1506zbMath1463.05386arXiv1605.02972OpenAlexW2963314063MaRDI QIDQ5135735

Reza Jafarpour-Golzari

Publication date: 23 November 2020

Full work available at URL: https://arxiv.org/abs/1605.02972

zbMATH Keywords

matchingperfect matchingvertex coverHall's theorem\(k\)-uniform \(k\)-partite hypergraph

Mathematics Subject Classification ID

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

Cites Work

• On Ryser's conjecture
• On a criterion for matchability in hypergraphs
• On a possible extension of Hall's theorem to bipartite hypergraphs
• Ryser's conjecture for tripartite 3-graphs
• Matchings and covers in hypergraphs
• Matchings in n-partite n-graphs
• A condition for matchability in hypergraphs
• Perfect matchings in \(r\)-partite \(r\)-graphs
• Matchings in hypergraphs of large minimum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs