1 citations · 1 across the 1 of their papers we have counts for
1 paper
Michal Karoński, Ed Overman, Boris Pittel
Existence of a perfect matching in a random bipartite digraph with bipartition (V1,V2), ∣Vi∣=n, is studied. The graph is generated in two rounds of random selections of a p…