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

DOI10.1016/J.JCTB.2020.03.004MaRDI QIDQ2173435zbMATH OpenOpenAlexFDO

Authors Michal Karonski, Edward A. II Overman, Boris 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

asymptoticsbipartite graphsperfect matchingsrandom

Mathematics Subject Classification ID

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

Recommendations

• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• Corrigendum to: ``On disjoint matchings in cubic graphs
• Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two
• Corrigendum to ``Algebraic characterizations of regularity properties in bipartite graphs
• Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
• Corrigendum to: ``A conjecture on bipartite graphical regular representations
• Corrigendum to: The chromatic uniqueness of complete bipartite graphs
• Correction to: Configuration models of random hypergraphs

Cites work

• Balls and bins: A study in negative dependence
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• scientific article; zbMATH DE number 3415878 (Why is no real title available?)
• Matchings in random regular bipartite digraphs
• Maximum matchings in a class of random graphs
• Problems in algebraic combinatorics
• Stirling Behavior is Asymptotically Normal
• The 1-Factors of Oriented Graphs

Cited in

(8)

• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• The random bipartite nearest neighbor graphs
• Perfect matchings in inhomogeneous random bipartite graphs in random environment
• Perfect matchings in the semirandom graph process
• Power of \(k\) choices in the semi-random graph process
• Cliques, chromatic number, and independent sets in the semi-random process
• Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
• Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds

Describes a project that uses

Uses Software

• Matlab

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

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