Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures in Latin Squares.”https://doi.org/10.1007/s11856-023-2513-9__Israel Journal of Mathematics. Springer Nature, 2023.https://doi.org/10.1007/s11856-023-2513-9 .

Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erds–McKay Conjecture.”https://doi.org/10.1017/fmp.2023.17__Forum of Mathematics, Pi. Cambridge University Press, 2023.https://doi.org/10.1017/fmp.2023.17 .

Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Enumerating Matroids and Linear Spaces.”https://doi.org/10.5802/crmath.423__Comptes Rendus Mathematique. Academie des Sciences, 2023.https://doi.org/10.5802/crmath.423 .

Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Large Deviations in Random Latin Squares.”https://doi.org/10.1112/blms.12638__Bulletin of the London Mathematical Society. Wiley, 2022.https://doi.org/10.1112/blms.12638 .

Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.”https://doi.org/10.1109/FOCS52979.2021.00075__In 62nd Annual IEEE Symposium on Foundations of Computer Science, 2022:720–26. IEEE, 2022.https://doi.org/10.1109/FOCS52979.2021.00075 .

Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.”https://doi.org/10.1109/TIT.2022.3148779__IEEE Transactions on Information Theory. IEEE, 2022.https://doi.org/10.1109/TIT.2022.3148779 .

Kwan, Matthew Alan, Lisa Sauermann, and Yufei Zhao. “Extension Complexity of Low-Dimensional Polytopes.”https://doi.org/10.1090/tran/8614__Transactions of the American Mathematical Society. American Mathematical Society, 2022.https://doi.org/10.1090/tran/8614 .

Fox, Jacob, Matthew Alan Kwan, and Benny Sudakov. “Acyclic Subgraphs of Tournaments with High Chromatic Number.”https://doi.org/10.1112/blms.12446__Bulletin of the London Mathematical Society. Wiley, 2021.https://doi.org/10.1112/blms.12446 .

Buci, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, and Benny Sudakov. “Halfway to Rota’s Basis Conjecture.”https://doi.org/10.1093/imrn/rnaa004__International Mathematics Research Notices. Oxford University Press, 2020.https://doi.org/10.1093/imrn/rnaa004 .

Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.”https://doi.org/10.1093/imrn/rny064__International Mathematics Research Notices. Oxford University Press, 2020.https://doi.org/10.1093/imrn/rny064 .

He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.”https://doi.org/10.1112/blms.12345__Bulletin of the London Mathematical Society. Wiley, 2020.https://doi.org/10.1112/blms.12345 .

Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.”https://doi.org/10.1017/fms.2020.29__Forum of Mathematics. Cambridge University Press, 2020.https://doi.org/10.1017/fms.2020.29 .

Buci, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, Benny Sudakov, Tuan Tran, and Adam Zsolt Wagner. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.”https://doi.org/10.1007/s11856-020-2035-7__Israel Journal of Mathematics. Springer, 2020.https://doi.org/10.1007/s11856-020-2035-7 .

Kwan, Matthew Alan, Shoham Letzter, Benny Sudakov, and Tuan Tran. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.”https://doi.org/10.1007/s00493-019-4086-0__Combinatorica. Springer, 2020.https://doi.org/10.1007/s00493-019-4086-0 .

Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.”https://doi.org/10.1112/plms.12373__Proceedings of the London Mathematical Society. Wiley, 2020.https://doi.org/10.1112/plms.12373 .

Kwan, Matthew Alan, Benny Sudakov, and Tuan Tran. “Anticoncentration for Subgraph Statistics.”https://doi.org/10.1112/jlms.12192__Journal of the London Mathematical Society. Wiley, 2019.https://doi.org/10.1112/jlms.12192 .

Conlon, David, Jacob Fox, Matthew Alan Kwan, and Benny Sudakov. “Hypergraph Cuts above the Average.”https://doi.org/10.1007/s11856-019-1897-z__Israel Journal of Mathematics. Springer, 2019.https://doi.org/10.1007/s11856-019-1897-z .

Kwan, Matthew Alan, and Benny Sudakov. “Proof of a Conjecture on Induced Subgraphs of Ramsey Graphs.”https://doi.org/10.1090/tran/7729__Transactions of the American Mathematical Society. American Mathematical Society, 2019.https://doi.org/10.1090/tran/7729 .

Krivelevich, Michael, Matthew Alan Kwan, PoShen Loh, and Benny Sudakov. “The Random Kmatchingfree Process.”https://doi.org/10.1002/rsa.20814__Random Structures and Algorithms. Wiley, 2018.https://doi.org/10.1002/rsa.20814 .

Ferber, Asaf, Matthew Alan Kwan, and Benny Sudakov. “Counting Hamilton Cycles in Sparse Random Directed Graphs.”https://doi.org/10.1002/rsa.20815__Random Structures and Algorithms. Wiley, 2018.https://doi.org/10.1002/rsa.20815 .

Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.”https://doi.org/10.1002/rsa.20742__Random Structures and Algorithms. Wiley, 2018.https://doi.org/10.1002/rsa.20742 .

Kwan, Matthew Alan, Benny Sudakov, and Pedro Vieira. “Non-Trivially Intersecting Multi-Part Families.”https://doi.org/10.1016/j.jcta.2017.12.001__Journal of Combinatorial Theory Series A. Elsevier, 2018.https://doi.org/10.1016/j.jcta.2017.12.001 .

Bandeira, Afonso S., Asaf Ferber, and Matthew Alan Kwan. “Resilience for the Littlewood-Offord Problem.”https://doi.org/10.1016/j.endm.2017.06.025__Electronic Notes in Discrete Mathematics. Elsevier, 2017.https://doi.org/10.1016/j.endm.2017.06.025 .

Krivelevich, Michael, Matthew Alan Kwan, and Benny Sudakov. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.”https://doi.org/10.1137/15m1032910__SIAM Journal on Discrete Mathematics. Society for Industrial &; Applied Mathematics, 2017.https://doi.org/10.1137/15m1032910 .

Bandeira, Afonso S., Asaf Ferber, and Matthew Alan Kwan. “Resilience for the Littlewood–Offord Problem.”https://doi.org/10.1016/j.aim.2017.08.031__Advances in Mathematics. Elsevier, 2017.https://doi.org/10.1016/j.aim.2017.08.031 .

Greenhill, Catherine, Mikhail Isaev, Matthew Alan Kwan, and Brendan D. McKay. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.”https://doi.org/10.1016/j.ejc.2017.02.003__European Journal of Combinatorics. Elsevier, 2017.https://doi.org/10.1016/j.ejc.2017.02.003 .

Krivelevich, Michael, Matthew Alan Kwan, and Benny Sudakov. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.”https://doi.org/10.1017/s0963548316000079__Combinatorics, Probability and Computing. Cambridge University Press, 2016.https://doi.org/10.1017/s0963548316000079 .

Krivelevich, Michael, Matthew Alan Kwan, and Benny Sudakov. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.”https://doi.org/10.1016/j.endm.2015.06.027__Electronic Notes in Discrete Mathematics. Elsevier, 2015.https://doi.org/10.1016/j.endm.2015.06.027 .

Greenhill, Catherine, Matthew Alan Kwan, and David Wind. “On the Number of Spanning Trees in Random Regular Graphs.”https://doi.org/10.37236/3752__The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2014.https://doi.org/10.37236/3752 .