scientific article; zbMATH DE number 3218580

From MaRDI portal
Publication:5345648





Let \(B\) denote a random \(m\) by \(n\) bipartite graph with \([m \log m+c m]\) edges. It is shown that if \(m \sim \lambda n\), where \(\lambda>1\), then the probability that \(B\) is connected tends to \(\exp \left(-e^{-c}\right)\) as \(n\) tends to infinity.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5345648)