The so called upper tail problem in the Erdos-Renyi random graph comes up naturally in the study of exponential random graph models and related graph ensembles with prescribed subgraph densities. The problem is broadly twofold: (1) To estimate the probability that the number of copies of a graph H in a random graph is atypically large. (2) To describe the structure of the random graph, in...