Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
From MaRDI portal
Publication:1405096
DOI10.1016/S0095-8956(03)00024-8zbMath1026.05091MaRDI QIDQ1405096
Michał Karoński, Boris G. Pittel
Publication date: 25 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables ⋮ Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph ⋮ Karp–Sipser on Random Graphs with a Fixed Degree Sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Matching theory
- Maximum matchings in a class of random graphs
- Matchings in random regular bipartite digraphs
- On Perfect Matchings and Hamilton Cycles in Sums of Random Trees
- Matchings in superpositions of (n, n)‐bipartite trees
- Average Case Analysis of a Heuristic for the Assignment Problem
- The random bipartite nearest neighbor graphs
This page was built for publication: Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
