We can calculate using a dynamic programming algorithm in time ??? well, maybe we can do it more efficiently, but the DP I thought was the following: let???s calculate where it is the expected size of the -connected component of a random graph with nodes where the edges between and other nodes have probability and an edge between and have probability .