A note on the duality between matchings and vertex covers in balanced hypergraphs

DOI10.1007/S10878-015-9887-5MaRDI QIDQ306113zbMATH OpenOpenAlexFDO

Authors Robert Scheidweiler, Eberhard Triesch

Publication date 31 August 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-015-9887-5

zbMATH Keywords

balanced hypergraphdualityHall's theoremhypergraphKoenig's theoremmatchingvertex cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Perfect matchings in balanced hypergraphs---a combinatorial approach
• A short proof of K�nig's matching theorem
• scientific article; zbMATH DE number 3882481
• Perfect matchings in balanced hypergraphs
• Extensions of Gallai's graph covering theorems for uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3427408 (Why is no real title available?)
• scientific article; zbMATH DE number 3557519 (Why is no real title available?)
• scientific article; zbMATH DE number 3327126 (Why is no real title available?)
• scientific article; zbMATH DE number 3363617 (Why is no real title available?)
• Perfect matchings in balanced hypergraphs
• Perfect matchings in balanced hypergraphs---a combinatorial approach

Cited in

(5)

• Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
• scientific article; zbMATH DE number 3882481 (Why is no real title available?)
• scientific article; zbMATH DE number 4108498 (Why is no real title available?)
• scientific article; zbMATH DE number 4127012 (Why is no real title available?)
• LP duality in infinite hypergraphs

This page was built for publication: A note on the duality between matchings and vertex covers in balanced hypergraphs

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