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 2021Show all

6 papers · 1 filter

math.CO2021

Enumerating Matroids and Linear Spaces

Matthew Kwan, Ashwin Sah, Mehtaab Sawhney

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(c n + o (n))^{n^{2} /6}$ , where $c=e^{…

math.CO2021

Note on random Latin squares and the triangle removal process

Matthew Kwan, Ashwin Sah, Mehtaab Sawhney

This is a companion note to the paper "Almost all Steiner triple systems have perfect matchings (arXiv:1611.02246). That paper contains several general lemmas about random Steiner…

math.CO2021

Friendly bisections of random graphs

Asaf Ferber, Matthew Kwan, Bhargav Narayanan +2

Resolving a conjecture of Füredi from 1988, we prove that with high probability, the random graph $G (n, 1/2)$ admits a friendly bisection of its vertex set, i.e., a partition of its…

math.CO2021

Large deviations in random Latin squares

Matthew Kwan, Ashwin Sah, Mehtaab Sawhney

In this note, we study large deviations of the number $N$ of intercalates ( $2 \times 2$ combinatorial subsquares which are themselves Latin squares) in a random $n \times n$ …

math.PR2021

Singularity of the k-core of a random graph

Asaf Ferber, Matthew Kwan, Ashwin Sah +1

Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and…

math.CO2021

Geometric and o-minimal Littlewood-Offord problems

Jacob Fox, Matthew Kwan, Hunter Spink

The classical Erdős-Littlewood-Offord theorem says that for nonzero vectors $a_{1}, \dots, a_{n} \in R^{d}$ , any $x \in R^{d}$ , and uniformly random $(ξ_1,\dots,ξ_n)\in\{-1,1…