Showing math.COShow all
2 papers · 1 filter
math.CO2024
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…
math.CO2023
The inertia bound is far from tight
Matthew Kwan, Yuval Wigderson
The inertia bound and ratio bound (also known as the Cvetković bound and Hoffman bound) are two fundamental inequalities in spectral graph theory, giving upper bounds on the indepe…