Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach

DOI10.1016/j.disc.2017.05.005zbMath1367.05149OpenAlexW2398960935MaRDI QIDQ2012539

Isabel Beckenbach, Robert Scheidweiler

Publication date: 1 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.05.005

zbMATH Keywords

balanced hypergraphHall's theorem\(f\)-factors in hypergraphsMengerian hypergraphperfect \(f\)-matchings in hypergraphsperfect hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• A note on the duality between matchings and vertex covers in balanced hypergraphs
• A simple existence criterion for \((g<f)\)-factors
• Matching theory
• Total unimodularity and combinatorial theorems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Normal hypergraphs and the perfect graph conjecture
• Perfect matchings in balanced hypergraphs
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item