Originally Posted by

**oreo** 1. Consider the set V = {1,2,...,n} and let p be a real number with 0 < p < 1. We construct a graph G = (V, E) with vertex set V , whose edge set E is determined by the following random process: Each unordered pair {o,j} of vertices, where i can't j, occurs as anedge in E with probability p, independently of the other unordered pairs. A triangle in G is an unordered triple {i,j,k} of distinct vertices, such that {i,j} , {j,k}, and {k,i} are edges in G. Dene the random variable X to be the total number of triangles in the graph G. Determine the expected value E(X).