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

DOI10.1016/J.DISC.2017.05.005zbMATH Open1367.05149OpenAlexW2398960935MaRDI QIDQ2012539FDOQ2012539

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)