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

DOI10.1007/S10878-015-9887-5zbMATH Open1354.90158OpenAlexW2043727926MaRDI QIDQ306113FDOQ306113

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

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

zbMATH Keywords

matchingdualityhypergraphvertex coverbalanced hypergraphHall's theoremKoenig's theorem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Perfect matchings in balanced hypergraphs---a combinatorial approach
• Perfect matchings in balanced hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
• Title not available (Why is that?)

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)