A central limit theorem for the matching number of a sparse random graph

Margalit Glasgow, Matthew Kwan, Ashwin Sah +1

In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erdős-Rényi random graph, in an influential paper pioneering the so-called differential e…