Perfect matchings in random bipartite graphs with minimal degree at least 2

Authors:
Alan Frieze
Affiliations:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
Venue:
Random Structures & Algorithms
Year:
2005

Citing 0
Cited 2

Asymptotic Moments of the Bottleneck Assignment Problem

Mathematics of Operations Research
Karp-sipser on random graphs with a fixed degree sequence

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a random bipartite graph with n+n vertices and cn random edges, and minimum degree at least two, has a perfect matching whp. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 26, 2005Supported in part by NSF Grant CCR-9818411.