Substructures in Latin squares
M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256 (2023) 363–416.

Anticoncentration in Ramsey graphs and a proof of the Erds–McKay conjecture
M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (2023).

Enumerating matroids and linear spaces
M.A. Kwan, A. Sah, M. Sawhney, Comptes Rendus Mathematique 361 (2023) 565–575.

Large deviations in random latin squares
M.A. Kwan, A. Sah, M. Sawhney, Bulletin of the London Mathematical Society 54 (2022) 1420–1438.

List-decodability with large radius for Reed-Solomon codes
A. Ferber, M.A. Kwan, L. Sauermann, in:, 62nd Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2022, pp. 720–726.

List-decodability with large radius for Reed-Solomon codes
A. Ferber, M.A. Kwan, L. Sauermann, IEEE Transactions on Information Theory 68 (2022) 3823–3828.

Extension complexity of low-dimensional polytopes
M.A. Kwan, L. Sauermann, Y. Zhao, Transactions of the American Mathematical Society 375 (2022) 4209–4250.

Acyclic subgraphs of tournaments with high chromatic number
J. Fox, M.A. Kwan, B. Sudakov, Bulletin of the London Mathematical Society 53 (2021) 619–630.

Halfway to Rota’s basis conjecture
M. Buci, M.A. Kwan, A. Pokrovskiy, B. Sudakov, International Mathematics Research Notices 2020 (2020) 8007–8026.

Ramsey graphs induce subgraphs of quadratically many sizes
M.A. Kwan, B. Sudakov, International Mathematics Research Notices 2020 (2020) 1621–1638.

Universality of random permutations
X. He, M.A. Kwan, Bulletin of the London Mathematical Society 52 (2020) 515–529.

Almost all Steiner triple systems are almost resolvable
A. Ferber, M.A. Kwan, Forum of Mathematics 8 (2020).

Nearly-linear monotone paths in edge-ordered graphs
M. Buci, M.A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A.Z. Wagner, Israel Journal of Mathematics 238 (2020) 663–685.

Dense induced bipartite subgraphs in triangle-free graphs
M.A. Kwan, S. Letzter, B. Sudakov, T. Tran, Combinatorica 40 (2020) 283–305.

Almost all Steiner triple systems have perfect matchings
M.A. Kwan, Proceedings of the London Mathematical Society 121 (2020) 1468–1495.

Anticoncentration for subgraph statistics
M.A. Kwan, B. Sudakov, T. Tran, Journal of the London Mathematical Society 99 (2019) 757–777.

Hypergraph cuts above the average
D. Conlon, J. Fox, M.A. Kwan, B. Sudakov, Israel Journal of Mathematics 233 (2019) 67–111.

Proof of a conjecture on induced subgraphs of Ramsey graphs
M.A. Kwan, B. Sudakov, Transactions of the American Mathematical Society 372 (2019) 5571–5594.

The random kmatchingfree process
M. Krivelevich, M.A. Kwan, P. Loh, B. Sudakov, Random Structures and Algorithms 53 (2018) 692–716.

Counting Hamilton cycles in sparse random directed graphs
A. Ferber, M.A. Kwan, B. Sudakov, Random Structures and Algorithms 53 (2018) 592–603.

Intercalates and discrepancy in random Latin squares
M.A. Kwan, B. Sudakov, Random Structures and Algorithms 52 (2018) 181–196.

Non-trivially intersecting multi-part families
M.A. Kwan, B. Sudakov, P. Vieira, Journal of Combinatorial Theory Series A 156 (2018) 44–60.

Resilience for the Littlewood-Offord problem
A.S. Bandeira, A. Ferber, M.A. Kwan, Electronic Notes in Discrete Mathematics 61 (2017) 93–99.

Bounded-degree spanning trees in randomly perturbed graphs
M. Krivelevich, M.A. Kwan, B. Sudakov, SIAM Journal on Discrete Mathematics 31 (2017) 155–171.

Resilience for the Littlewood–Offord problem
A.S. Bandeira, A. Ferber, M.A. Kwan, Advances in Mathematics 319 (2017) 292–312.

The average number of spanning trees in sparse graphs with given degrees
C. Greenhill, M. Isaev, M.A. Kwan, B.D. McKay, European Journal of Combinatorics 63 (2017) 6–25.

Cycles and matchings in randomly perturbed digraphs and hypergraphs
M. Krivelevich, M.A. Kwan, B. Sudakov, Combinatorics, Probability and Computing 25 (2016) 909–927.

Cycles and matchings in randomly perturbed digraphs and hypergraphs
M. Krivelevich, M.A. Kwan, B. Sudakov, Electronic Notes in Discrete Mathematics 49 (2015) 181–187.

On the number of spanning trees in random regular graphs
C. Greenhill, M.A. Kwan, D. Wind, The Electronic Journal of Combinatorics 21 (2014).