jump to navigation

Problem of the Day #371: Connecting Components March 24, 2012

Posted by Alex in : potd , trackback

Suppose we have a list of $100$ nodes. Every second, two nodes are randomly chosen and an edge is drawn in between the two nodes. What is the expected number of seconds that must elapse before the number of connected components of the graph is less than or equal to $5$?


no comments yet - be the first?