Matthew Kwan

activity

20132023

most citedCycles and matchings in randomly perturbed digraphs and hypergraphs

49 citations · 158 across the 33 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016★ 24 cited

Almost all Steiner triple systems have perfect matchings

Matthew Kwan

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a g…

math.CO2016

Resilience for the Littlewood-Offord Problem

Afonso S. Bandeira, Asaf Ferber, Matthew Kwan

Consider the sum $X (ξ) = \sum_{i = 1}^{n} a_{i} ξ_{i}$ , where $a = (a_{i})_{i = 1}^{n}$ is a sequence of non-zero reals and $ξ = (ξ_{i})_{i = 1}^{n}$ is a sequence of i.i.d. Rademacher random variables (that…

math.CO2016★ 1 cited

Intercalates and Discrepancy in Random Latin Squares

Matthew Kwan, Benny Sudakov

An intercalate in a Latin square is a $2 \times 2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n \times n$ Latin square. We prove that asymptotically…

math.CO2016

The average number of spanning trees in sparse graphs with given degrees

Catherine Greenhill, Mikhail Isaev, Matthew Kwan +1

We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence $d = (d_{1}, \dots, d_{n})$ , provided that the numb…