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

arXiv2402.05851MaRDI QIDQ6520985FDOQ6520985

Authors: Margalit Glasgow, Matthew Kwan, Ashwin Sah, Mehtaab Sawhney 

This page was built for publication: A central limit theorem for the matching number of a sparse random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6520985)