Distance-2-matchings of random graphs

DOI10.1007/S00026-004-0207-5MaRDI QIDQ1889893zbMATH OpenOpenAlexFDO

Authors Christian M. Reidys

Publication date 13 December 2004

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-004-0207-5

zbMATH Keywords

martingalerandom graphinduced matchingdistance-2-matching

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A concentration inequality for maximum matching size in random graphs¹
• Random matchings in regular graphs
• scientific article; zbMATH DE number 6960780
• Distance edge-colourings and matchings
• scientific article; zbMATH DE number 2127722

Cited in

(4)

• A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
• Euclidean random matching in 2D for non-constant densities
• scientific article; zbMATH DE number 6960780 (Why is no real title available?)
• The strong matching number of a random graph

This page was built for publication: Distance-2-matchings of random graphs

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