Kwan, M. A., Sah, A., Sawhney, M., &; Simkin, M. (2023). Substructures in Latin squares. Israel Journal of Mathematics. Springer Nature.https://doi.org/10.1007/s11856-023-2513-9 

Kwan, M. A., Sah, A., Sauermann, L., &; Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erds–McKay conjecture. Forum of Mathematics, Pi. Cambridge University Press.https://doi.org/10.1017/fmp.2023.17 

Kwan, M. A., Sah, A., &; Sawhney, M. (2023). Enumerating matroids and linear spaces. Comptes Rendus Mathematique. Academie des Sciences.https://doi.org/10.5802/crmath.423 

Kwan, M. A., Sah, A., &; Sawhney, M. (2022). Large deviations in random latin squares. Bulletin of the London Mathematical Society. Wiley.https://doi.org/10.1112/blms.12638 

Ferber, A., Kwan, M. A., &; Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. In 62nd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022, pp. 720–726). Denver, CO, United States: IEEE.https://doi.org/10.1109/FOCS52979.2021.00075 

Ferber, A., Kwan, M. A., &; Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. IEEE.https://doi.org/10.1109/TIT.2022.3148779 

Kwan, M. A., Sauermann, L., &; Zhao, Y. (2022). Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. American Mathematical Society.https://doi.org/10.1090/tran/8614 

Fox, J., Kwan, M. A., &; Sudakov, B. (2021). Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. Wiley.https://doi.org/10.1112/blms.12446 

Buci, M., Kwan, M. A., Pokrovskiy, A., &; Sudakov, B. (2020). Halfway to Rota’s basis conjecture. International Mathematics Research Notices. Oxford University Press.https://doi.org/10.1093/imrn/rnaa004 

Kwan, M. A., &; Sudakov, B. (2020). Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. Oxford University Press.https://doi.org/10.1093/imrn/rny064 

He, X., &; Kwan, M. A. (2020). Universality of random permutations. Bulletin of the London Mathematical Society. Wiley.https://doi.org/10.1112/blms.12345 

Ferber, A., &; Kwan, M. A. (2020). Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. Cambridge University Press.https://doi.org/10.1017/fms.2020.29 

Buci, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., &; Wagner, A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-020-2035-7 

Kwan, M. A., Letzter, S., Sudakov, B., &; Tran, T. (2020). Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. Springer.https://doi.org/10.1007/s00493-019-4086-0 

Kwan, M. A. (2020). Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. Wiley.https://doi.org/10.1112/plms.12373 

Kwan, M. A., Sudakov, B., &; Tran, T. (2019). Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. Wiley.https://doi.org/10.1112/jlms.12192 

Conlon, D., Fox, J., Kwan, M. A., &; Sudakov, B. (2019). Hypergraph cuts above the average. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-019-1897-z 

Kwan, M. A., &; Sudakov, B. (2019). Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. American Mathematical Society.https://doi.org/10.1090/tran/7729 

Krivelevich, M., Kwan, M. A., Loh, P., &; Sudakov, B. (2018). The random kmatchingfree process. Random Structures and Algorithms. Wiley.https://doi.org/10.1002/rsa.20814 

Ferber, A., Kwan, M. A., &; Sudakov, B. (2018). Counting Hamilton cycles in sparse random directed graphs. Random Structures and Algorithms. Wiley.https://doi.org/10.1002/rsa.20815 

Kwan, M. A., &; Sudakov, B. (2018). Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. Wiley.https://doi.org/10.1002/rsa.20742 

Kwan, M. A., Sudakov, B., &; Vieira, P. (2018). Non-trivially intersecting multi-part families. Journal of Combinatorial Theory Series A. Elsevier.https://doi.org/10.1016/j.jcta.2017.12.001 

Bandeira, A. S., Ferber, A., &; Kwan, M. A. (2017). Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. Elsevier.https://doi.org/10.1016/j.endm.2017.06.025 

Krivelevich, M., Kwan, M. A., &; Sudakov, B. (2017). Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/15m1032910 

Bandeira, A. S., Ferber, A., &; Kwan, M. A. (2017). Resilience for the Littlewood–Offord problem. Advances in Mathematics. Elsevier.https://doi.org/10.1016/j.aim.2017.08.031 

Greenhill, C., Isaev, M., Kwan, M. A., &; McKay, B. D. (2017). The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. Elsevier.https://doi.org/10.1016/j.ejc.2017.02.003 

Krivelevich, M., Kwan, M. A., &; Sudakov, B. (2016). Cycles and matchings in randomly perturbed digraphs and hypergraphs. Combinatorics, Probability and Computing. Cambridge University Press.https://doi.org/10.1017/s0963548316000079 

Krivelevich, M., Kwan, M. A., &; Sudakov, B. (2015). Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. Elsevier.https://doi.org/10.1016/j.endm.2015.06.027 

Greenhill, C., Kwan, M. A., &; Wind, D. (2014). On the number of spanning trees in random regular graphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics.https://doi.org/10.37236/3752