Perfect matchings in random bipartite graphs with minimal degree at least 2

DOI10.1002/rsa.20044zbMath1062.05133OpenAlexW4252227552WikidataQ57401507 ScholiaQ57401507MaRDI QIDQ4680412

Alan M. Frieze

Publication date: 1 June 2005

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20044

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Karp–Sipser on Random Graphs with a Fixed Degree Sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect matchings in random bipartite graphs with minimal degree at least 2