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.
Recommendations
Cited in
(12)- Random near-regular graphs and the node packing problem
- Properties of random difference graphs
- Sets that are connected in two random graphs
- Random bipartite graphs
- On a product dimension of bipartite graphs
- scientific article; zbMATH DE number 4137081 (Why is no real title available?)
- scientific article; zbMATH DE number 4072999 (Why is no real title available?)
- The random bipartite nearest neighbor graphs
- The number of components in a random bipartite graph
- VIRTUALLY FIBERING RIGHT-ANGLED COXETER GROUPS
- On random presentations with fixed relator length
- scientific article; zbMATH DE number 4183463 (Why is no real title available?)
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)