An -vertex graph is called -Ramsey if it has no clique or independent set of size (i.e., if it has near-optimal Ramsey behavior). We study edge-statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a -Ramsey graph. One …