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]

Authors

Michal Karonski

This author has not been identified. Look up 'Michal Karonski' in Google

Ed Overman 0001

This author has not been identified. Look up 'Ed Overman 0001' in Google

Boris G. Pittel

This author has not been identified. Look up 'Boris G. Pittel' in Google