Erratum to: Tight bound for matching

DOI10.1007/S10878-012-9566-8MaRDI QIDQ2392740zbMATH OpenOpenAlexFDO

Authors Yijie Han

Publication date 2 August 2013

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

Full work available at URL https://doi.org/10.1007/s10878-012-9566-8

zbMATH Keywords

combinatorial problemsgraph algorithmlower boundmatching

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Tight bound for matching
• Tight lower bounds on the size of a maximum matching in a regular graph
• Bounds on maximum \(b\)-matchings
• Tight lower bounds on the matching number in a graph with given maximum degree
• scientific article; zbMATH DE number 2081000

Cited in

(2)

• Match-bounds revisited
• Tight bound for matching

This page was built for publication: Erratum to: Tight bound for matching

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