On the Number of Spanning Trees in Random Regular Graphs. - Catherine S. Greenhill; Matthew Kwan 001; David Wind (Electron. J. Comb., 2014)

Cycles and matchings in randomly perturbed digraphs and hypergraphs. - Michael Krivelevich; Matthew Kwan 001; Benny Sudakov (Electron. Notes Discret. Math., 2015)

The average number of spanning trees in sparse graphs with given degrees. - Catherine S. Greenhill; Mikhail Isaev; Matthew Kwan 001; Brendan D. McKay (Eur. J. Comb., 2017)

Resilience for the Littlewood-Offord Problem. - Afonso S. Bandeira; Asaf Ferber; Matthew Kwan 001 (Electron. Notes Discret. Math., 2017)

Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. - Michael Krivelevich; Matthew Kwan 001; Benny Sudakov (SIAM J. Discret. Math., 2017)

Non-trivially intersecting multi-part families. - Matthew Kwan 001; Benny Sudakov; Pedro Vieira 003 (J. Comb. Theory A, 2018)

Counting Hamilton cycles in sparse random directed graphs. - Asaf Ferber; Matthew Kwan 001; Benny Sudakov (Random Struct. Algorithms, 2018)

The random k-matching-free process. - Michael Krivelevich; Matthew Kwan 001; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2018)

Intercalates and discrepancy in random Latin squares. - Matthew Kwan 001; Benny Sudakov (Random Struct. Algorithms, 2018)

Anticoncentration for subgraph statistics. - Matthew Kwan 001; Benny Sudakov; Tuan Tran (J. Lond. Math. Soc., 2019)

Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. - Matthew Kwan 001; Shoham Letzter; Benny Sudakov; Tuan Tran (Comb., 2020)

Extension complexity of low-dimensional polytopes. - Matthew Kwan 001; Lisa Sauermann; Yufei Zhao (CoRR, 2020)

Lower bounds for superpatterns and universal sequences. - Zachary Chroman; Matthew Kwan 001; Mihir Singhal (J. Comb. Theory A, 2021)

Singularity of sparse random matrices: simple proofs. - Asaf Ferber; Matthew Kwan 001; Lisa Sauermann (Comb. Probab. Comput., 2022)

Dirac-type theorems in random hypergraphs. - Asaf Ferber; Matthew Kwan 001 (J. Comb. Theory B, 2022)

List-Decodability With Large Radius for Reed-Solomon Codes. - Asaf Ferber; Matthew Kwan 001; Lisa Sauermann (IEEE Trans. Inf. Theory, 2022)

The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging. - Michael Anastos; Benedikt Auerbach; Mirza Ahad Baig; Miguel Cueto Noval; Matthew Kwan 001; Guillermo Pascual-Perez; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2024)

Smoothed Analysis for Graph Isomorphism. - Michael Anastos; Matthew Kwan 001; Benjamin Moore (STOC, 2025)