On a perfect matching in a random digraph with average out-degree below two

Michal Karonski, Ed Overman 0001, Boris G. Pittel. On a perfect matching in a random digraph with average out-degree below two. J. Comb. Theory, Ser. B, 143:226-258, 2020. [doi]

@article{KaronskiOP20,
  title = {On a perfect matching in a random digraph with average out-degree below two},
  author = {Michal Karonski and Ed Overman 0001 and Boris G. Pittel},
  year = {2020},
  doi = {10.1016/j.jctb.2020.03.004},
  url = {https://doi.org/10.1016/j.jctb.2020.03.004},
  researchr = {https://researchr.org/publication/KaronskiOP20},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Theory, Ser. B},
  volume = {143},
  pages = {226-258},
}