Timeline for Random graphs require O(n log(n)) edges until they are almost certainly fully connected - what are more concrete boundaries ?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 28, 2013 at 13:18 | comment | added | j.c. | These articles discuss the phase transition of the formation of the giant component, which happens when the number of edges is near $n/2$. The full connectivity transition that this question is asking about occurs much later and is not quite related. | |
| May 28, 2013 at 11:12 | history | answered | Goldstern | CC BY-SA 3.0 |