Tight bound for matching

DOI10.1007/S10878-010-9299-5MaRDI QIDQ431927zbMATH OpenOpenAlexFDO

Authors Yijie Han

Publication date 3 July 2012

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

Full work available at URL https://doi.org/10.1007/s10878-010-9299-5

zbMATH Keywords

matchinggraph algorithmslower boundcombinatorial problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Erratum to: Tight bound for matching
• Tight lower bounds on the size of a maximum matching in a regular graph
• Tight lower bounds on the matching number in a graph with given maximum degree
• Tight bounds on maximal and maximum matchings
• scientific article; zbMATH DE number 2081000

Cites work

• A constructive proof of Vizing's theorem
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Matching for Graphs of Bounded Degree
• The Factorization of Linear Graphs
• Tight bounds on maximal and maximum matchings

Cited in

(13)

• scientific article; zbMATH DE number 2081000 (Why is no real title available?)
• Matching with Regular Constraints
• Match-bounds revisited
• Generalization of Erdős-Gallai edge bound
• Erratum to: Tight bound for matching
• Almost exact matchings
• The lower bound on the number of maximum matchings of a graph
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
• The tight upper bound for the number of matchings of tricyclic graphs
• A Tight Bound for EMAC
• Matching and edge-connectivity in graphs with given maximum degree
• Tight bounds on maximal and maximum matchings
• Bounds on maximum \(b\)-matchings

This page was built for publication: Tight bound for matching

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