- #1

- 193

- 2

Suppose a graph has say 20 nodes with no edge initially, and at each instance, 4 (different) nodes are randomly drawn with equal probability and all 6 edges among them are added to the graph. How do I estimate the expected number of iterations before the graph become connected (just connected, no need to be completed)? Thanks.