Perfect f-matchings and f-factors in hypergraphs -- a combinatorial approach

DOI10.1016/J.DISC.2017.05.005MaRDI QIDQ2012539zbMATH OpenOpenAlexFDO

Authors 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

\(f\)-factors in hypergraphsbalanced hypergraphHall's theoremMengerian 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)

Recommendations

• Matchings and flows in hypergraphs
• Perfect matchings in balanced hypergraphs---a combinatorial approach
• Perfect matchings in uniform hypergraphs with large minimum degree
• The Complexity of Perfect Matching Problems on Dense Hypergraphs
• Perfect matching of 3-uniform hypergraphs

Cites work

• A note on the duality between matchings and vertex covers in balanced hypergraphs
• A simple existence criterion for \((g<f)\)-factors
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 3156381 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 3557519 (Why is no real title available?)
• Matching theory
• Normal hypergraphs and the perfect graph conjecture
• Perfect matchings in balanced hypergraphs
• Reducibility among combinatorial problems
• Total unimodularity and combinatorial theorems

Cited in

(3)

• \(F\)-factors in hypergraphs via absorption
• The existence of bimatching designs
• Polarizations of Artin monomial ideals

This page was built for publication: Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012539)