Matthew Alan Kwan
Kwan Group
38 Publications
2025 | Published | Journal Article | IST-REx-ID: 18157 |

Brunck, Florestan R, Books, Hallways, and social butterflies: A note on sliding block puzzles. Mathematical Intelligencer 47. 2025
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19433 |

Anastos, Michael, Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma 13. 2025
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19554 |

Glasgow, Margalit, A central limit theorem for the matching number of a sparse random graph. Journal of the London Mathematical Society 111 (4). 2025
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 18559 |

M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “High-girth Steiner triple systems,” Annals of Mathematics, vol. 200, no. 3. Princeton University, pp. 1059–1156, 2024.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18702 |

M. Anastos et al., “The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging,” in 22nd International Conference on Theory of Cryptography, Milan, Italy, 2024, vol. 15364, pp. 413–443.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2024 | Published | Journal Article | IST-REx-ID: 18583 |

M. Anastos, O. Cooley, M. Kang, and M. A. Kwan, “Partitioning problems via random processes,” Journal of the London Mathematical Society, vol. 110, no. 6. Wiley, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 17376 |

M. A. Kwan and Y. Wigderson, “The inertia bound is far from tight,” Bulletin of the London Mathematical Society, vol. 56, no. 10. London Mathematical Society, pp. 3196–3208, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 17475 |

I. Koval and M. A. Kwan, “Exponentially many graphs are determined by their spectrum,” Quarterly Journal of Mathematics, vol. 75, no. 3. Oxford University Press, pp. 869–899, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14444 |

M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416, 2023.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 15173 |

M. A. Kwan, A. Sah, and M. Sawhney, “Enumerating matroids and linear spaces,” Comptes Rendus Mathematique, vol. 361, no. G2. Academie des Sciences, pp. 565–575, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14499 |

M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” Forum of Mathematics, Pi, vol. 11. Cambridge University Press, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11186 |

M. A. Kwan, A. Sah, and M. Sawhney, “Large deviations in random latin squares,” Bulletin of the London Mathematical Society, vol. 54, no. 4. Wiley, pp. 1420–1438, 2022.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11443 |

M. A. Kwan, L. Sauermann, and Y. Zhao, “Extension complexity of low-dimensional polytopes,” Transactions of the American Mathematical Society, vol. 375, no. 6. American Mathematical Society, pp. 4209–4250, 2022.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 17077 |

A. Ferber, M. A. Kwan, B. Narayanan, A. Sah, and M. Sawhney, “Friendly bisections of random graphs,” Communications of the American Mathematical Society, vol. 2, no. 10. American Mathematical Society, pp. 380–416, 2022.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 11145 |

Ferber, Asaf, List-decodability with large radius for Reed-Solomon codes. 62nd Annual IEEE Symposium on Foundations of Computer Science 2022. 2022
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 10775 |

A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” IEEE Transactions on Information Theory, vol. 68, no. 6. IEEE, pp. 3823–3828, 2022.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9572 |

J. Fox, M. A. Kwan, and B. Sudakov, “Acyclic subgraphs of tournaments with high chromatic number,” Bulletin of the London Mathematical Society, vol. 53, no. 2. Wiley, pp. 619–630, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9573 |

X. He and M. A. Kwan, “Universality of random permutations,” Bulletin of the London Mathematical Society, vol. 52, no. 3. Wiley, pp. 515–529, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9576 |

M. Bucić, M. A. Kwan, A. Pokrovskiy, and B. Sudakov, “Halfway to Rota’s basis conjecture,” International Mathematics Research Notices, vol. 2020, no. 21. Oxford University Press, pp. 8007–8026, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9577 |

M. A. Kwan and B. Sudakov, “Ramsey graphs induce subgraphs of quadratically many sizes,” International Mathematics Research Notices, vol. 2020, no. 6. Oxford University Press, pp. 1621–1638, 2020.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9578 |

M. Bucić, M. A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner, “Nearly-linear monotone paths in edge-ordered graphs,” Israel Journal of Mathematics, vol. 238, no. 2. Springer, pp. 663–685, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9581 |

M. A. Kwan, “Almost all Steiner triple systems have perfect matchings,” Proceedings of the London Mathematical Society, vol. 121, no. 6. Wiley, pp. 1468–1495, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9582 |

M. A. Kwan, S. Letzter, B. Sudakov, and T. Tran, “Dense induced bipartite subgraphs in triangle-free graphs,” Combinatorica, vol. 40, no. 2. Springer, pp. 283–305, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9583 |

A. Ferber and M. A. Kwan, “Almost all Steiner triple systems are almost resolvable,” Forum of Mathematics, vol. 8. Cambridge University Press, 2020.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2019 | Published | Journal Article | IST-REx-ID: 9580 |

D. Conlon, J. Fox, M. A. Kwan, and B. Sudakov, “Hypergraph cuts above the average,” Israel Journal of Mathematics, vol. 233, no. 1. Springer, pp. 67–111, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 9585 |

M. A. Kwan and B. Sudakov, “Proof of a conjecture on induced subgraphs of Ramsey graphs,” Transactions of the American Mathematical Society, vol. 372, no. 8. American Mathematical Society, pp. 5571–5594, 2019.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 9586 |

M. A. Kwan, B. Sudakov, and T. Tran, “Anticoncentration for subgraph statistics,” Journal of the London Mathematical Society, vol. 99, no. 3. Wiley, pp. 757–777, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 9565 |

A. Ferber, M. A. Kwan, and B. Sudakov, “Counting Hamilton cycles in sparse random directed graphs,” Random Structures and Algorithms, vol. 53, no. 4. Wiley, pp. 592–603, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 9567 |

M. Krivelevich, M. A. Kwan, P. Loh, and B. Sudakov, “The random k‐matching‐free process,” Random Structures and Algorithms, vol. 53, no. 4. Wiley, pp. 692–716, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 9568 |

M. A. Kwan and B. Sudakov, “Intercalates and discrepancy in random Latin squares,” Random Structures and Algorithms, vol. 52, no. 2. Wiley, pp. 181–196, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 9587 |

M. A. Kwan, B. Sudakov, and P. Vieira, “Non-trivially intersecting multi-part families,” Journal of Combinatorial Theory Series A, vol. 156. Elsevier, pp. 44–60, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9574 |

A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood-Offord problem,” Electronic Notes in Discrete Mathematics, vol. 61. Elsevier, pp. 93–99, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9588 |

A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood–Offord problem,” Advances in Mathematics, vol. 319. Elsevier, pp. 292–312, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9589 |

C. Greenhill, M. Isaev, M. A. Kwan, and B. D. McKay, “The average number of spanning trees in sparse graphs with given degrees,” European Journal of Combinatorics, vol. 63. Elsevier, pp. 6–25, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9590 |

M. Krivelevich, M. A. Kwan, and B. Sudakov, “Bounded-degree spanning trees in randomly perturbed graphs,” SIAM Journal on Discrete Mathematics, vol. 31, no. 1. Society for Industrial & Applied Mathematics, pp. 155–171, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Journal Article | IST-REx-ID: 9591 |

M. Krivelevich, M. A. Kwan, and B. Sudakov, “Cycles and matchings in randomly perturbed digraphs and hypergraphs,” Combinatorics, Probability and Computing, vol. 25, no. 6. Cambridge University Press, pp. 909–927, 2016.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Published | Journal Article | IST-REx-ID: 9575 |

M. Krivelevich, M. A. Kwan, and B. Sudakov, “Cycles and matchings in randomly perturbed digraphs and hypergraphs,” Electronic Notes in Discrete Mathematics, vol. 49. Elsevier, pp. 181–187, 2015.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Published | Journal Article | IST-REx-ID: 9594 |

C. Greenhill, M. A. Kwan, and D. Wind, “On the number of spanning trees in random regular graphs,” The Electronic Journal of Combinatorics, vol. 21, no. 1. The Electronic Journal of Combinatorics, 2014.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
1 Grants
Randomness and structure in combinatorics (RANDSTRUCT)
2023-05-01 – 2028-04-30
European Research Council
38 Publications
2025 | Published | Journal Article | IST-REx-ID: 18157 |

Brunck, Florestan R, Books, Hallways, and social butterflies: A note on sliding block puzzles. Mathematical Intelligencer 47. 2025
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19433 |

Anastos, Michael, Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma 13. 2025
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19554 |

Glasgow, Margalit, A central limit theorem for the matching number of a sparse random graph. Journal of the London Mathematical Society 111 (4). 2025
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 18559 |

M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “High-girth Steiner triple systems,” Annals of Mathematics, vol. 200, no. 3. Princeton University, pp. 1059–1156, 2024.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18702 |

M. Anastos et al., “The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging,” in 22nd International Conference on Theory of Cryptography, Milan, Italy, 2024, vol. 15364, pp. 413–443.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2024 | Published | Journal Article | IST-REx-ID: 18583 |

M. Anastos, O. Cooley, M. Kang, and M. A. Kwan, “Partitioning problems via random processes,” Journal of the London Mathematical Society, vol. 110, no. 6. Wiley, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 17376 |

M. A. Kwan and Y. Wigderson, “The inertia bound is far from tight,” Bulletin of the London Mathematical Society, vol. 56, no. 10. London Mathematical Society, pp. 3196–3208, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 17475 |

I. Koval and M. A. Kwan, “Exponentially many graphs are determined by their spectrum,” Quarterly Journal of Mathematics, vol. 75, no. 3. Oxford University Press, pp. 869–899, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14444 |

M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416, 2023.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 15173 |

M. A. Kwan, A. Sah, and M. Sawhney, “Enumerating matroids and linear spaces,” Comptes Rendus Mathematique, vol. 361, no. G2. Academie des Sciences, pp. 565–575, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14499 |

M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” Forum of Mathematics, Pi, vol. 11. Cambridge University Press, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11186 |

M. A. Kwan, A. Sah, and M. Sawhney, “Large deviations in random latin squares,” Bulletin of the London Mathematical Society, vol. 54, no. 4. Wiley, pp. 1420–1438, 2022.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11443 |

M. A. Kwan, L. Sauermann, and Y. Zhao, “Extension complexity of low-dimensional polytopes,” Transactions of the American Mathematical Society, vol. 375, no. 6. American Mathematical Society, pp. 4209–4250, 2022.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 17077 |

A. Ferber, M. A. Kwan, B. Narayanan, A. Sah, and M. Sawhney, “Friendly bisections of random graphs,” Communications of the American Mathematical Society, vol. 2, no. 10. American Mathematical Society, pp. 380–416, 2022.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 11145 |

Ferber, Asaf, List-decodability with large radius for Reed-Solomon codes. 62nd Annual IEEE Symposium on Foundations of Computer Science 2022. 2022
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 10775 |

A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” IEEE Transactions on Information Theory, vol. 68, no. 6. IEEE, pp. 3823–3828, 2022.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9572 |

J. Fox, M. A. Kwan, and B. Sudakov, “Acyclic subgraphs of tournaments with high chromatic number,” Bulletin of the London Mathematical Society, vol. 53, no. 2. Wiley, pp. 619–630, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9573 |

X. He and M. A. Kwan, “Universality of random permutations,” Bulletin of the London Mathematical Society, vol. 52, no. 3. Wiley, pp. 515–529, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9576 |

M. Bucić, M. A. Kwan, A. Pokrovskiy, and B. Sudakov, “Halfway to Rota’s basis conjecture,” International Mathematics Research Notices, vol. 2020, no. 21. Oxford University Press, pp. 8007–8026, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9577 |

M. A. Kwan and B. Sudakov, “Ramsey graphs induce subgraphs of quadratically many sizes,” International Mathematics Research Notices, vol. 2020, no. 6. Oxford University Press, pp. 1621–1638, 2020.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9578 |

M. Bucić, M. A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner, “Nearly-linear monotone paths in edge-ordered graphs,” Israel Journal of Mathematics, vol. 238, no. 2. Springer, pp. 663–685, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9581 |

M. A. Kwan, “Almost all Steiner triple systems have perfect matchings,” Proceedings of the London Mathematical Society, vol. 121, no. 6. Wiley, pp. 1468–1495, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9582 |

M. A. Kwan, S. Letzter, B. Sudakov, and T. Tran, “Dense induced bipartite subgraphs in triangle-free graphs,” Combinatorica, vol. 40, no. 2. Springer, pp. 283–305, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 9583 |

A. Ferber and M. A. Kwan, “Almost all Steiner triple systems are almost resolvable,” Forum of Mathematics, vol. 8. Cambridge University Press, 2020.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2019 | Published | Journal Article | IST-REx-ID: 9580 |

D. Conlon, J. Fox, M. A. Kwan, and B. Sudakov, “Hypergraph cuts above the average,” Israel Journal of Mathematics, vol. 233, no. 1. Springer, pp. 67–111, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 9585 |

M. A. Kwan and B. Sudakov, “Proof of a conjecture on induced subgraphs of Ramsey graphs,” Transactions of the American Mathematical Society, vol. 372, no. 8. American Mathematical Society, pp. 5571–5594, 2019.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 9586 |

M. A. Kwan, B. Sudakov, and T. Tran, “Anticoncentration for subgraph statistics,” Journal of the London Mathematical Society, vol. 99, no. 3. Wiley, pp. 757–777, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 9565 |

A. Ferber, M. A. Kwan, and B. Sudakov, “Counting Hamilton cycles in sparse random directed graphs,” Random Structures and Algorithms, vol. 53, no. 4. Wiley, pp. 592–603, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 9567 |

M. Krivelevich, M. A. Kwan, P. Loh, and B. Sudakov, “The random k‐matching‐free process,” Random Structures and Algorithms, vol. 53, no. 4. Wiley, pp. 692–716, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 9568 |

M. A. Kwan and B. Sudakov, “Intercalates and discrepancy in random Latin squares,” Random Structures and Algorithms, vol. 52, no. 2. Wiley, pp. 181–196, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 9587 |

M. A. Kwan, B. Sudakov, and P. Vieira, “Non-trivially intersecting multi-part families,” Journal of Combinatorial Theory Series A, vol. 156. Elsevier, pp. 44–60, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9574 |

A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood-Offord problem,” Electronic Notes in Discrete Mathematics, vol. 61. Elsevier, pp. 93–99, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9588 |

A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood–Offord problem,” Advances in Mathematics, vol. 319. Elsevier, pp. 292–312, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9589 |

C. Greenhill, M. Isaev, M. A. Kwan, and B. D. McKay, “The average number of spanning trees in sparse graphs with given degrees,” European Journal of Combinatorics, vol. 63. Elsevier, pp. 6–25, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9590 |

M. Krivelevich, M. A. Kwan, and B. Sudakov, “Bounded-degree spanning trees in randomly perturbed graphs,” SIAM Journal on Discrete Mathematics, vol. 31, no. 1. Society for Industrial & Applied Mathematics, pp. 155–171, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Journal Article | IST-REx-ID: 9591 |

M. Krivelevich, M. A. Kwan, and B. Sudakov, “Cycles and matchings in randomly perturbed digraphs and hypergraphs,” Combinatorics, Probability and Computing, vol. 25, no. 6. Cambridge University Press, pp. 909–927, 2016.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Published | Journal Article | IST-REx-ID: 9575 |

M. Krivelevich, M. A. Kwan, and B. Sudakov, “Cycles and matchings in randomly perturbed digraphs and hypergraphs,” Electronic Notes in Discrete Mathematics, vol. 49. Elsevier, pp. 181–187, 2015.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Published | Journal Article | IST-REx-ID: 9594 |

C. Greenhill, M. A. Kwan, and D. Wind, “On the number of spanning trees in random regular graphs,” The Electronic Journal of Combinatorics, vol. 21, no. 1. The Electronic Journal of Combinatorics, 2014.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv