Perfect matchings in balanced hypergraphs---a combinatorial approach
From MaRDI portal
Publication:1872893
DOI10.1007/s004930200020zbMath1012.05118OpenAlexW1978371952MaRDI QIDQ1872893
Andreas Huck, Eberhard Triesch
Publication date: 18 May 2003
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930200020
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
A note on the duality between matchings and vertex covers in balanced hypergraphs ⋮ Hall's and Kőnig's theorem in graphs and hypergraphs ⋮ Balanced matrices
This page was built for publication: Perfect matchings in balanced hypergraphs---a combinatorial approach
