2 papers
math.CO2025
Counting Perfect Matchings In Dirac Hypergraphs
Matthew Kwan, Roodabeh Safavi, Yiting Wang
One of the foundational theorems of extremal graph theory is Dirac's theorem, which says that if an n-vertex graph G has minimum degree at least n/2, then G has a Hamilton cycle, a…
math.CO2025
Algebraic aspects of the polynomial Littlewood-Offord problem
Zhihan Jin, Matthew Kwan, Lisa Sauermann +1
Consider a degree- polynomial of independent Rademacher random variables . To what extent can concentrate on a single…