Consider a random graph $G$ on $n$ vertices $\{1, 2, . . . , n\}$ where every possible edge is present independently with probability $p \in [0, 1]$.
Introduce indicator random variables for complete subgraphs on five vertices in $G$ and compute the expected value of the number of complete subgraphs on five vertices in $G$.
How do you this?