📐 Connectivity Threshold

The threshold for $G(n,p)$ to be connected is $p = \\frac{\\log n}{n}$.

From: Introduction to Graph Theory

Learn more: https://west-graphs-deploy.vercel.app/#/section/27

Explore all courses: https://mathacademy-cyan.vercel.app

Reply to this note

Please Login to reply.

Discussion

No replies yet.