On a perfect matching in a random digraph with average out-degree below two
Authors:
- Michal KarońskiMKMichal Karoński
- Ed OvermanEOEd Overman
- Boris PittelBPBoris Pittel
- 1 July 2020
- journal article
- correction
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 143, 226-258
Abstract
No abstract availableKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Existence of a perfect matching in a random (1+e−1)—out bipartite graphJournal of Combinatorial Theory, Series B, 2003
- Balls and bins: A study in negative dependenceRandom Structures & Algorithms, 1998
- Maximum matchings in a class of random graphsJournal of Combinatorial Theory, Series B, 1986
- Matchings in random regular bipartite digraphsDiscrete Mathematics, 1980
- Stirling Behavior is Asymptotically NormalThe Annals of Mathematical Statistics, 1967
- The 1-factors of oriented graphsProceedings of the American Mathematical Society, 1953