Extremal, enumerative and probabilistic results on ordered hypergraph matchings
M. Anastos, Z. Jin, M.A. Kwan, B. Sudakov, Forum of Mathematics, Sigma 13 (2025).

On heroes in digraphs with forbidden induced forests
A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2025).

A central limit theorem for the matching number of a sparse random graph
M. Glasgow, M.A. Kwan, A. Sah, M. Sawhney, Journal of the London Mathematical Society 111 (2025).

Smoothed analysis for graph isomorphism
M. Anastos, M.A. Kwan, B. Moore, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–2106.

Partitioning problems via random processes
M. Anastos, O. Cooley, M. Kang, M.A. Kwan, Journal of the London Mathematical Society 110 (2024).

The inertia bound is far from tight
M.A. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024) 3196–3208.

Exponentially many graphs are determined by their spectrum
I. Koval, M.A. Kwan, Quarterly Journal of Mathematics 75 (2024) 869–899.

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).