Kwan MA, Sah A, Sawhney M, Simkin M. Substructures in Latin squares. Israel Journal of Mathematics. 2023;256(2):363-416. doi:10.1007/s11856-023-2513-9

Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs and a proof of the Erds–McKay conjecture. Forum of Mathematics, Pi. 2023;11. doi:10.1017/fmp.2023.17

Kwan MA, Sah A, Sawhney M. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 2023;361():565-575. doi:10.5802/crmath.423

Kwan MA, Sah A, Sawhney M. Large deviations in random latin squares. Bulletin of the London Mathematical Society. 2022;54(4):1420-1438. doi:10.1112/blms.12638

Ferber A, Kwan MA, Sauermann L. List-decodability with large radius for Reed-Solomon codes. In: 62nd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022. IEEE; 2022:720-726. doi:10.1109/FOCS52979.2021.00075

Ferber A, Kwan MA, Sauermann L. List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. 2022;68(6):3823-3828. doi:10.1109/TIT.2022.3148779

Kwan MA, Sauermann L, Zhao Y. Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. 2022;375(6):4209-4250. doi:10.1090/tran/8614

Fox J, Kwan MA, Sudakov B. Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. 2021;53(2):619-630. doi:10.1112/blms.12446

Buci M, Kwan MA, Pokrovskiy A, Sudakov B. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020;2020(21):8007-8026. doi:10.1093/imrn/rnaa004

Kwan MA, Sudakov B. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020;2020(6):1621–1638. doi:10.1093/imrn/rny064

He X, Kwan MA. Universality of random permutations. Bulletin of the London Mathematical Society. 2020;52(3):515-529. doi:10.1112/blms.12345

Ferber A, Kwan MA. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 2020;8. doi:10.1017/fms.2020.29

Buci M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 2020;238(2):663-685. doi:10.1007/s11856-020-2035-7

Kwan MA, Letzter S, Sudakov B, Tran T. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 2020;40(2):283-305. doi:10.1007/s00493-019-4086-0

Kwan MA. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 2020;121(6):1468-1495. doi:10.1112/plms.12373

Kwan MA, Sudakov B, Tran T. Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. 2019;99(3):757-777. doi:10.1112/jlms.12192

Conlon D, Fox J, Kwan MA, Sudakov B. Hypergraph cuts above the average. Israel Journal of Mathematics. 2019;233(1):67-111. doi:10.1007/s11856-019-1897-z

Kwan MA, Sudakov B. Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. 2019;372(8):5571-5594. doi:10.1090/tran/7729

Krivelevich M, Kwan MA, Loh P, Sudakov B. The random kmatchingfree process. Random Structures and Algorithms. 2018;53(4):692-716. doi:10.1002/rsa.20814

Ferber A, Kwan MA, Sudakov B. Counting Hamilton cycles in sparse random directed graphs. Random Structures and Algorithms. 2018;53(4):592-603. doi:10.1002/rsa.20815

Kwan MA, Sudakov B. Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. 2018;52(2):181-196. doi:10.1002/rsa.20742

Kwan MA, Sudakov B, Vieira P. Non-trivially intersecting multi-part families. Journal of Combinatorial Theory Series A. 2018;156:44-60. doi:10.1016/j.jcta.2017.12.001

Bandeira AS, Ferber A, Kwan MA. Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. 2017;61:93-99. doi:10.1016/j.endm.2017.06.025

Krivelevich M, Kwan MA, Sudakov B. Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. 2017;31(1):155-171. doi:10.1137/15m1032910

Bandeira AS, Ferber A, Kwan MA. Resilience for the Littlewood–Offord problem. Advances in Mathematics. 2017;319:292-312. doi:10.1016/j.aim.2017.08.031

Greenhill C, Isaev M, Kwan MA, McKay BD. The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. 2017;63:6-25. doi:10.1016/j.ejc.2017.02.003

Krivelevich M, Kwan MA, Sudakov B. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Combinatorics, Probability and Computing. 2016;25(6):909-927. doi:10.1017/s0963548316000079

Krivelevich M, Kwan MA, Sudakov B. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. 2015;49:181-187. doi:10.1016/j.endm.2015.06.027

Greenhill C, Kwan MA, Wind D. On the number of spanning trees in random regular graphs. The Electronic Journal of Combinatorics. 2014;21(1). doi:10.37236/3752