COMP 731 - Assignment 3 - Due 27 July 2000

Start with an n-vertex graph G containing no edges and randomly add edges until G becomes connected. Let F(n) be the expected number of edges that must be added until the graph becomes connected.
  1. Compute F(4).
  2. Estimate F(100) as accurately as you can.
  3. Now estimate F(200), F(300), ..., F(1000), too, and graph all ten values. Conjecture an estimate for F(n) which is accurate for large n.
You can find a good pseudorandom number generator in http://www.cs.ucdavis.edu/~rogaway/classes/110/spring97/public_code