Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph

DOI10.1016/j.jctb.2020.03.004zbMath1437.05197OpenAlexW3012421265MaRDI QIDQ2173435

Michał Karoński, Edward A. II Overman, Boris G. Pittel

Publication date: 22 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2020.03.004

zbMATH Keywords

randomasymptoticsbipartite graphsperfect matchings

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)

Power of \(k\) choices in the semi-random graph process ⋮ Perfect Matchings in the Semirandom Graph Process

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Maximum matchings in a class of random graphs
• Matchings in random regular bipartite digraphs
• Problems in algebraic combinatorics
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• Balls and bins: A study in negative dependence
• Stirling Behavior is Asymptotically Normal
• The 1-Factors of Oriented Graphs

This page was built for publication: Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph