Kwan, Matthew Alan, et al. “Substructures in Latin Squares.”10.1007/s11856-023-2513-9__Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9.

Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erds–McKay Conjecture.”10.1017/fmp.2023.17__Forum of Mathematics, Pi, vol. 11, e21, Cambridge University Press, 2023, doi:10.1017/fmp.2023.17.

Kwan, Matthew Alan, et al. “Enumerating Matroids and Linear Spaces.”10.5802/crmath.423__Comptes Rendus Mathematique, vol. 361, no. , Academie des Sciences, 2023, pp. 565–75, doi:10.5802/crmath.423.

Kwan, Matthew Alan, et al. “Large Deviations in Random Latin Squares.”10.1112/blms.12638__Bulletin of the London Mathematical Society, vol. 54, no. 4, Wiley, 2022, pp. 1420–38, doi:10.1112/blms.12638.

Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.”10.1109/FOCS52979.2021.00075__62nd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022, IEEE, 2022, pp. 720–26, doi:10.1109/FOCS52979.2021.00075.

Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.”10.1109/TIT.2022.3148779__IEEE Transactions on Information Theory, vol. 68, no. 6, IEEE, 2022, pp. 3823–28, doi:10.1109/TIT.2022.3148779.

Kwan, Matthew Alan, et al. “Extension Complexity of Low-Dimensional Polytopes.”10.1090/tran/8614__Transactions of the American Mathematical Society, vol. 375, no. 6, American Mathematical Society, 2022, pp. 4209–50, doi:10.1090/tran/8614.

Fox, Jacob, et al. “Acyclic Subgraphs of Tournaments with High Chromatic Number.”10.1112/blms.12446__Bulletin of the London Mathematical Society, vol. 53, no. 2, Wiley, 2021, pp. 619–30, doi:10.1112/blms.12446.

Buci, Matija, et al. “Halfway to Rota’s Basis Conjecture.”10.1093/imrn/rnaa004__International Mathematics Research Notices, vol. 2020, no. 21, Oxford University Press, 2020, pp. 8007–26, doi:10.1093/imrn/rnaa004.

Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.”10.1093/imrn/rny064__International Mathematics Research Notices, vol. 2020, no. 6, Oxford University Press, 2020, pp. 1621–1638, doi:10.1093/imrn/rny064.

He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.”10.1112/blms.12345__Bulletin of the London Mathematical Society, vol. 52, no. 3, Wiley, 2020, pp. 515–29, doi:10.1112/blms.12345.

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

Buci, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.”10.1007/s11856-020-2035-7__Israel Journal of Mathematics, vol. 238, no. 2, Springer, 2020, pp. 663–85, doi:10.1007/s11856-020-2035-7.

Kwan, Matthew Alan, et al. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.”10.1007/s00493-019-4086-0__Combinatorica, vol. 40, no. 2, Springer, 2020, pp. 283–305, doi:10.1007/s00493-019-4086-0.

Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.”10.1112/plms.12373__Proceedings of the London Mathematical Society, vol. 121, no. 6, Wiley, 2020, pp. 1468–95, doi:10.1112/plms.12373.

Kwan, Matthew Alan, et al. “Anticoncentration for Subgraph Statistics.”10.1112/jlms.12192__Journal of the London Mathematical Society, vol. 99, no. 3, Wiley, 2019, pp. 757–77, doi:10.1112/jlms.12192.

Conlon, David, et al. “Hypergraph Cuts above the Average.”10.1007/s11856-019-1897-z__Israel Journal of Mathematics, vol. 233, no. 1, Springer, 2019, pp. 67–111, doi:10.1007/s11856-019-1897-z.

Kwan, Matthew Alan, and Benny Sudakov. “Proof of a Conjecture on Induced Subgraphs of Ramsey Graphs.”10.1090/tran/7729__Transactions of the American Mathematical Society, vol. 372, no. 8, American Mathematical Society, 2019, pp. 5571–94, doi:10.1090/tran/7729.

Krivelevich, Michael, et al. “The Random Kmatchingfree Process.”10.1002/rsa.20814__Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 692–716, doi:10.1002/rsa.20814.

Ferber, Asaf, et al. “Counting Hamilton Cycles in Sparse Random Directed Graphs.”10.1002/rsa.20815__Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 592–603, doi:10.1002/rsa.20815.

Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.”10.1002/rsa.20742__Random Structures and Algorithms, vol. 52, no. 2, Wiley, 2018, pp. 181–96, doi:10.1002/rsa.20742.

Kwan, Matthew Alan, et al. “Non-Trivially Intersecting Multi-Part Families.”10.1016/j.jcta.2017.12.001__Journal of Combinatorial Theory Series A, vol. 156, Elsevier, 2018, pp. 44–60, doi:10.1016/j.jcta.2017.12.001.

Bandeira, Afonso S., et al. “Resilience for the Littlewood-Offord Problem.”10.1016/j.endm.2017.06.025__Electronic Notes in Discrete Mathematics, vol. 61, Elsevier, 2017, pp. 93–99, doi:10.1016/j.endm.2017.06.025.

Krivelevich, Michael, et al. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.”10.1137/15m1032910__SIAM Journal on Discrete Mathematics, vol. 31, no. 1, Society for Industrial &; Applied Mathematics, 2017, pp. 155–71, doi:10.1137/15m1032910.

Bandeira, Afonso S., et al. “Resilience for the Littlewood–Offord Problem.”10.1016/j.aim.2017.08.031__Advances in Mathematics, vol. 319, Elsevier, 2017, pp. 292–312, doi:10.1016/j.aim.2017.08.031.

Greenhill, Catherine, et al. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.”10.1016/j.ejc.2017.02.003__European Journal of Combinatorics, vol. 63, Elsevier, 2017, pp. 6–25, doi:10.1016/j.ejc.2017.02.003.

Krivelevich, Michael, et al. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.”10.1017/s0963548316000079__Combinatorics, Probability and Computing, vol. 25, no. 6, Cambridge University Press, 2016, pp. 909–27, doi:10.1017/s0963548316000079.

Krivelevich, Michael, et al. “Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.”10.1016/j.endm.2015.06.027__Electronic Notes in Discrete Mathematics, vol. 49, Elsevier, 2015, pp. 181–87, doi:10.1016/j.endm.2015.06.027.

Greenhill, Catherine, et al. “On the Number of Spanning Trees in Random Regular Graphs.”10.37236/3752__The Electronic Journal of Combinatorics, vol. 21, no. 1, .45, The Electronic Journal of Combinatorics, 2014, doi:10.37236/3752.