The average size of maximal matchings in graphs

DOI10.1007/S10878-024-01144-8MaRDI QIDQ6497032zbMATH OpenFDO

Authors Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot

Publication date 6 May 2024

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

Full work available at URL https://doi.org/10.1007/S10878-024-01144-8

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Extremal graphs for average sizes of maximal matchings
• The average size of matchings in graphs
• Small maximal matchings in random graphs.
• scientific article; zbMATH DE number 1512672
• On matchings in graphs

Cites work

• Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
• Analytic combinatorics
• Counting domineering positions
• Counting maximal matchings in linear polymers
• Edge Dominating Sets in Graphs
• Greedy matching in bipartite random graphs
• Greedy matching: guarantees and limitations
• scientific article; zbMATH DE number 4099072 (Why is no real title available?)
• scientific article; zbMATH DE number 1003244 (Why is no real title available?)
• scientific article; zbMATH DE number 1033855 (Why is no real title available?)
• scientific article; zbMATH DE number 1484052 (Why is no real title available?)
• scientific article; zbMATH DE number 6737879 (Why is no real title available?)
• Maximal matchings in polyspiro and benzenoid chains
• Randomized greedy matching
• Randomized greedy matching. II
• The average performance of the greedy matching algorithm
• The average size of matchings in graphs
• The number of maximal matchings in polyphenylene chains

Cited in

(2)

• Extremal graphs for average sizes of maximal matchings
• Extremal trees with fixed order and diameter for average size of maximal matchings

This page was built for publication: The average size of maximal matchings in graphs

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