It looks like there's only one paper in this tag, so it's history isn't too exciting,
but you can still check it out below!
This paper proves a central limit theorem for the matching number of sparse Erdős–Rényi random graphs. Specifically, it shows that the fluctuations in the matching number around its mean are asymptotically Gaussian, strengthening a 1981 law of large numbers result of Karp and Sipser. The new contribution is a proof handling certain degeneracies arising in the subcritica...