Random graphs. In a random graph on n vertices for each pair of vertices i and j we independently include the edge {i, j} in the graph with probability 1/2. Show that with high probability every two vertices have at least n/4 - squareroot n log n common neighbors