29 Publications

Mark all

[29]
2023 | Journal Article | IST-REx-ID: 14444 | OA
Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2023). Substructures in Latin squares. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2513-9
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[28]
2023 | Journal Article | IST-REx-ID: 14499 | OA
Kwan, M. A., Sah, A., Sauermann, L., & Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. Cambridge University Press. https://doi.org/10.1017/fmp.2023.17
[Published Version] View | Files available | DOI | arXiv
 
[27]
2023 | Journal Article | IST-REx-ID: 15173 | OA
Kwan, M. A., Sah, A., & Sawhney, M. (2023). Enumerating matroids and linear spaces. Comptes Rendus Mathematique. Academie des Sciences. https://doi.org/10.5802/crmath.423
[Published Version] View | Files available | DOI | arXiv
 
[26]
2022 | Journal Article | IST-REx-ID: 11186 | OA
Kwan, M. A., Sah, A., & Sawhney, M. (2022). Large deviations in random latin squares. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12638
[Published Version] View | Files available | DOI | WoS | arXiv
 
[25]
2022 | Conference Paper | IST-REx-ID: 11145 | OA
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. In 62nd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022, pp. 720–726). Denver, CO, United States: IEEE. https://doi.org/10.1109/FOCS52979.2021.00075
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[24]
2022 | Journal Article | IST-REx-ID: 10775 | OA
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2022.3148779
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[23]
2022 | Journal Article | IST-REx-ID: 11443 | OA
Kwan, M. A., Sauermann, L., & Zhao, Y. (2022). Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/8614
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[22]
2021 | Journal Article | IST-REx-ID: 9572 | OA
Fox, J., Kwan, M. A., & Sudakov, B. (2021). Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12446
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2020 | Journal Article | IST-REx-ID: 9576 | OA
Bucić, M., Kwan, M. A., Pokrovskiy, A., & Sudakov, B. (2020). Halfway to Rota’s basis conjecture. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnaa004
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2020 | Journal Article | IST-REx-ID: 9577 | OA
Kwan, M. A., & Sudakov, B. (2020). Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rny064
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[19]
2020 | Journal Article | IST-REx-ID: 9573 | OA
He, X., & Kwan, M. A. (2020). Universality of random permutations. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12345
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[18]
2020 | Journal Article | IST-REx-ID: 9583 | OA
Ferber, A., & Kwan, M. A. (2020). Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. Cambridge University Press. https://doi.org/10.1017/fms.2020.29
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[17]
2020 | Journal Article | IST-REx-ID: 9578 | OA
Bucić, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., & Wagner, A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-020-2035-7
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2020 | Journal Article | IST-REx-ID: 9582 | OA
Kwan, M. A., Letzter, S., Sudakov, B., & Tran, T. (2020). Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. Springer. https://doi.org/10.1007/s00493-019-4086-0
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[15]
2020 | Journal Article | IST-REx-ID: 9581 | OA
Kwan, M. A. (2020). Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.12373
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[14]
2019 | Journal Article | IST-REx-ID: 9586 | OA
Kwan, M. A., Sudakov, B., & Tran, T. (2019). Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.12192
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[13]
2019 | Journal Article | IST-REx-ID: 9580 | OA
Conlon, D., Fox, J., Kwan, M. A., & Sudakov, B. (2019). Hypergraph cuts above the average. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-019-1897-z
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2019 | Journal Article | IST-REx-ID: 9585 | OA
Kwan, M. A., & Sudakov, B. (2019). Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7729
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[11]
2018 | Journal Article | IST-REx-ID: 9567 | OA
Krivelevich, M., Kwan, M. A., Loh, P., & Sudakov, B. (2018). The random k‐matching‐free process. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20814
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Journal Article | IST-REx-ID: 9565 | OA
Ferber, A., Kwan, M. A., & Sudakov, B. (2018). Counting Hamilton cycles in sparse random directed graphs. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20815
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Journal Article | IST-REx-ID: 9568 | OA
Kwan, M. A., & Sudakov, B. (2018). Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20742
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 9587 | OA
Kwan, M. A., Sudakov, B., & Vieira, P. (2018). Non-trivially intersecting multi-part families. Journal of Combinatorial Theory Series A. Elsevier. https://doi.org/10.1016/j.jcta.2017.12.001
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2017 | Journal Article | IST-REx-ID: 9574 | OA
Bandeira, A. S., Ferber, A., & Kwan, M. A. (2017). Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2017.06.025
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2017 | Journal Article | IST-REx-ID: 9590 | OA
Krivelevich, M., Kwan, M. A., & Sudakov, B. (2017). Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/15m1032910
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2017 | Journal Article | IST-REx-ID: 9588 | OA
Bandeira, A. S., Ferber, A., & Kwan, M. A. (2017). Resilience for the Littlewood–Offord problem. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2017.08.031
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2017 | Journal Article | IST-REx-ID: 9589 | OA
Greenhill, C., Isaev, M., Kwan, M. A., & McKay, B. D. (2017). The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2017.02.003
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[3]
2016 | Journal Article | IST-REx-ID: 9591 | OA
Krivelevich, M., Kwan, M. A., & Sudakov, B. (2016). Cycles and matchings in randomly perturbed digraphs and hypergraphs. Combinatorics, Probability and Computing. Cambridge University Press. https://doi.org/10.1017/s0963548316000079
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Journal Article | IST-REx-ID: 9575 | OA
Krivelevich, M., Kwan, M. A., & Sudakov, B. (2015). Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2015.06.027
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2014 | Journal Article | IST-REx-ID: 9594 | OA
Greenhill, C., Kwan, M. A., & Wind, D. (2014). On the number of spanning trees in random regular graphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics. https://doi.org/10.37236/3752
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Search

Filter Publications

29 Publications

Mark all

[29]
2023 | Journal Article | IST-REx-ID: 14444 | OA
Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2023). Substructures in Latin squares. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2513-9
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[28]
2023 | Journal Article | IST-REx-ID: 14499 | OA
Kwan, M. A., Sah, A., Sauermann, L., & Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. Cambridge University Press. https://doi.org/10.1017/fmp.2023.17
[Published Version] View | Files available | DOI | arXiv
 
[27]
2023 | Journal Article | IST-REx-ID: 15173 | OA
Kwan, M. A., Sah, A., & Sawhney, M. (2023). Enumerating matroids and linear spaces. Comptes Rendus Mathematique. Academie des Sciences. https://doi.org/10.5802/crmath.423
[Published Version] View | Files available | DOI | arXiv
 
[26]
2022 | Journal Article | IST-REx-ID: 11186 | OA
Kwan, M. A., Sah, A., & Sawhney, M. (2022). Large deviations in random latin squares. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12638
[Published Version] View | Files available | DOI | WoS | arXiv
 
[25]
2022 | Conference Paper | IST-REx-ID: 11145 | OA
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. In 62nd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022, pp. 720–726). Denver, CO, United States: IEEE. https://doi.org/10.1109/FOCS52979.2021.00075
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[24]
2022 | Journal Article | IST-REx-ID: 10775 | OA
Ferber, A., Kwan, M. A., & Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2022.3148779
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[23]
2022 | Journal Article | IST-REx-ID: 11443 | OA
Kwan, M. A., Sauermann, L., & Zhao, Y. (2022). Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/8614
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[22]
2021 | Journal Article | IST-REx-ID: 9572 | OA
Fox, J., Kwan, M. A., & Sudakov, B. (2021). Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12446
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2020 | Journal Article | IST-REx-ID: 9576 | OA
Bucić, M., Kwan, M. A., Pokrovskiy, A., & Sudakov, B. (2020). Halfway to Rota’s basis conjecture. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnaa004
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2020 | Journal Article | IST-REx-ID: 9577 | OA
Kwan, M. A., & Sudakov, B. (2020). Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rny064
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[19]
2020 | Journal Article | IST-REx-ID: 9573 | OA
He, X., & Kwan, M. A. (2020). Universality of random permutations. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12345
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[18]
2020 | Journal Article | IST-REx-ID: 9583 | OA
Ferber, A., & Kwan, M. A. (2020). Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. Cambridge University Press. https://doi.org/10.1017/fms.2020.29
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[17]
2020 | Journal Article | IST-REx-ID: 9578 | OA
Bucić, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., & Wagner, A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-020-2035-7
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2020 | Journal Article | IST-REx-ID: 9582 | OA
Kwan, M. A., Letzter, S., Sudakov, B., & Tran, T. (2020). Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. Springer. https://doi.org/10.1007/s00493-019-4086-0
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[15]
2020 | Journal Article | IST-REx-ID: 9581 | OA
Kwan, M. A. (2020). Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.12373
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[14]
2019 | Journal Article | IST-REx-ID: 9586 | OA
Kwan, M. A., Sudakov, B., & Tran, T. (2019). Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.12192
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[13]
2019 | Journal Article | IST-REx-ID: 9580 | OA
Conlon, D., Fox, J., Kwan, M. A., & Sudakov, B. (2019). Hypergraph cuts above the average. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-019-1897-z
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2019 | Journal Article | IST-REx-ID: 9585 | OA
Kwan, M. A., & Sudakov, B. (2019). Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7729
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[11]
2018 | Journal Article | IST-REx-ID: 9567 | OA
Krivelevich, M., Kwan, M. A., Loh, P., & Sudakov, B. (2018). The random k‐matching‐free process. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20814
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Journal Article | IST-REx-ID: 9565 | OA
Ferber, A., Kwan, M. A., & Sudakov, B. (2018). Counting Hamilton cycles in sparse random directed graphs. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20815
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Journal Article | IST-REx-ID: 9568 | OA
Kwan, M. A., & Sudakov, B. (2018). Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20742
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 9587 | OA
Kwan, M. A., Sudakov, B., & Vieira, P. (2018). Non-trivially intersecting multi-part families. Journal of Combinatorial Theory Series A. Elsevier. https://doi.org/10.1016/j.jcta.2017.12.001
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2017 | Journal Article | IST-REx-ID: 9574 | OA
Bandeira, A. S., Ferber, A., & Kwan, M. A. (2017). Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2017.06.025
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2017 | Journal Article | IST-REx-ID: 9590 | OA
Krivelevich, M., Kwan, M. A., & Sudakov, B. (2017). Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/15m1032910
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2017 | Journal Article | IST-REx-ID: 9588 | OA
Bandeira, A. S., Ferber, A., & Kwan, M. A. (2017). Resilience for the Littlewood–Offord problem. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2017.08.031
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2017 | Journal Article | IST-REx-ID: 9589 | OA
Greenhill, C., Isaev, M., Kwan, M. A., & McKay, B. D. (2017). The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2017.02.003
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[3]
2016 | Journal Article | IST-REx-ID: 9591 | OA
Krivelevich, M., Kwan, M. A., & Sudakov, B. (2016). Cycles and matchings in randomly perturbed digraphs and hypergraphs. Combinatorics, Probability and Computing. Cambridge University Press. https://doi.org/10.1017/s0963548316000079
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Journal Article | IST-REx-ID: 9575 | OA
Krivelevich, M., Kwan, M. A., & Sudakov, B. (2015). Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2015.06.027
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2014 | Journal Article | IST-REx-ID: 9594 | OA
Greenhill, C., Kwan, M. A., & Wind, D. (2014). On the number of spanning trees in random regular graphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics. https://doi.org/10.37236/3752
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Search

Filter Publications