29 Publications

Mark all

[29]
2023 | Journal Article | IST-REx-ID: 14444 | OA
Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares. Israel Journal of Mathematics. 256(2), 363–416.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[28]
2023 | Journal Article | IST-REx-ID: 14499 | OA
Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11, e21.
[Published Version] View | Files available | DOI | arXiv
 
[27]
2023 | Journal Article | IST-REx-ID: 15173 | OA
Kwan MA, Sah A, Sawhney M. 2023. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 361(G2), 565–575.
[Published Version] View | Files available | DOI | arXiv
 
[26]
2022 | Journal Article | IST-REx-ID: 11186 | OA
Kwan MA, Sah A, Sawhney M. 2022. Large deviations in random latin squares. Bulletin of the London Mathematical Society. 54(4), 1420–1438.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[25]
2022 | Conference Paper | IST-REx-ID: 11145 | OA
Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius for Reed-Solomon codes. 62nd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022, 720–726.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[24]
2022 | Journal Article | IST-REx-ID: 10775 | OA
Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. 68(6), 3823–3828.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[23]
2022 | Journal Article | IST-REx-ID: 11443 | OA
Kwan MA, Sauermann L, Zhao Y. 2022. Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. 375(6), 4209–4250.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[22]
2021 | Journal Article | IST-REx-ID: 9572 | OA
Fox J, Kwan MA, Sudakov B. 2021. Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. 53(2), 619–630.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2020 | Journal Article | IST-REx-ID: 9576 | OA
Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. 2020. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020(21), 8007–8026.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2020 | Journal Article | IST-REx-ID: 9577 | OA
Kwan MA, Sudakov B. 2020. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020(6), 1621–1638.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[19]
2020 | Journal Article | IST-REx-ID: 9573 | OA
He X, Kwan MA. 2020. Universality of random permutations. Bulletin of the London Mathematical Society. 52(3), 515–529.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[18]
2020 | Journal Article | IST-REx-ID: 9583 | OA
Ferber A, Kwan MA. 2020. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 8, e39.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[17]
2020 | Journal Article | IST-REx-ID: 9578 | OA
Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. 2020. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 238(2), 663–685.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2020 | Journal Article | IST-REx-ID: 9582 | OA
Kwan MA, Letzter S, Sudakov B, Tran T. 2020. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 40(2), 283–305.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[15]
2020 | Journal Article | IST-REx-ID: 9581 | OA
Kwan MA. 2020. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 121(6), 1468–1495.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[14]
2019 | Journal Article | IST-REx-ID: 9586 | OA
Kwan MA, Sudakov B, Tran T. 2019. Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. 99(3), 757–777.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[13]
2019 | Journal Article | IST-REx-ID: 9580 | OA
Conlon D, Fox J, Kwan MA, Sudakov B. 2019. Hypergraph cuts above the average. Israel Journal of Mathematics. 233(1), 67–111.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2019 | Journal Article | IST-REx-ID: 9585 | OA
Kwan MA, Sudakov B. 2019. Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. 372(8), 5571–5594.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[11]
2018 | Journal Article | IST-REx-ID: 9567 | OA
Krivelevich M, Kwan MA, Loh P, Sudakov B. 2018. The random k‐matching‐free process. Random Structures and Algorithms. 53(4), 692–716.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Journal Article | IST-REx-ID: 9565 | OA
Ferber A, Kwan MA, Sudakov B. 2018. Counting Hamilton cycles in sparse random directed graphs. Random Structures and Algorithms. 53(4), 592–603.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Journal Article | IST-REx-ID: 9568 | OA
Kwan MA, Sudakov B. 2018. Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. 52(2), 181–196.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 9587 | OA
Kwan MA, Sudakov B, Vieira P. 2018. Non-trivially intersecting multi-part families. Journal of Combinatorial Theory Series A. 156, 44–60.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2017 | Journal Article | IST-REx-ID: 9574 | OA
Bandeira AS, Ferber A, Kwan MA. 2017. Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. 61, 93–99.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2017 | Journal Article | IST-REx-ID: 9590 | OA
Krivelevich M, Kwan MA, Sudakov B. 2017. Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. 31(1), 155–171.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2017 | Journal Article | IST-REx-ID: 9588 | OA
Bandeira AS, Ferber A, Kwan MA. 2017. Resilience for the Littlewood–Offord problem. Advances in Mathematics. 319, 292–312.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2017 | Journal Article | IST-REx-ID: 9589 | OA
Greenhill C, Isaev M, Kwan MA, McKay BD. 2017. The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. 63, 6–25.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[3]
2016 | Journal Article | IST-REx-ID: 9591 | OA
Krivelevich M, Kwan MA, Sudakov B. 2016. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Combinatorics, Probability and Computing. 25(6), 909–927.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Journal Article | IST-REx-ID: 9575 | OA
Krivelevich M, Kwan MA, Sudakov B. 2015. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. 49, 181–187.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2014 | Journal Article | IST-REx-ID: 9594 | OA
Greenhill C, Kwan MA, Wind D. 2014. On the number of spanning trees in random regular graphs. The Electronic Journal of Combinatorics. 21(1), P1.45.
[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 MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares. Israel Journal of Mathematics. 256(2), 363–416.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[28]
2023 | Journal Article | IST-REx-ID: 14499 | OA
Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11, e21.
[Published Version] View | Files available | DOI | arXiv
 
[27]
2023 | Journal Article | IST-REx-ID: 15173 | OA
Kwan MA, Sah A, Sawhney M. 2023. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 361(G2), 565–575.
[Published Version] View | Files available | DOI | arXiv
 
[26]
2022 | Journal Article | IST-REx-ID: 11186 | OA
Kwan MA, Sah A, Sawhney M. 2022. Large deviations in random latin squares. Bulletin of the London Mathematical Society. 54(4), 1420–1438.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[25]
2022 | Conference Paper | IST-REx-ID: 11145 | OA
Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius for Reed-Solomon codes. 62nd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022, 720–726.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[24]
2022 | Journal Article | IST-REx-ID: 10775 | OA
Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. 68(6), 3823–3828.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[23]
2022 | Journal Article | IST-REx-ID: 11443 | OA
Kwan MA, Sauermann L, Zhao Y. 2022. Extension complexity of low-dimensional polytopes. Transactions of the American Mathematical Society. 375(6), 4209–4250.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[22]
2021 | Journal Article | IST-REx-ID: 9572 | OA
Fox J, Kwan MA, Sudakov B. 2021. Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. 53(2), 619–630.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[21]
2020 | Journal Article | IST-REx-ID: 9576 | OA
Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. 2020. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020(21), 8007–8026.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[20]
2020 | Journal Article | IST-REx-ID: 9577 | OA
Kwan MA, Sudakov B. 2020. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020(6), 1621–1638.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[19]
2020 | Journal Article | IST-REx-ID: 9573 | OA
He X, Kwan MA. 2020. Universality of random permutations. Bulletin of the London Mathematical Society. 52(3), 515–529.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[18]
2020 | Journal Article | IST-REx-ID: 9583 | OA
Ferber A, Kwan MA. 2020. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 8, e39.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[17]
2020 | Journal Article | IST-REx-ID: 9578 | OA
Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. 2020. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 238(2), 663–685.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2020 | Journal Article | IST-REx-ID: 9582 | OA
Kwan MA, Letzter S, Sudakov B, Tran T. 2020. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 40(2), 283–305.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[15]
2020 | Journal Article | IST-REx-ID: 9581 | OA
Kwan MA. 2020. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 121(6), 1468–1495.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[14]
2019 | Journal Article | IST-REx-ID: 9586 | OA
Kwan MA, Sudakov B, Tran T. 2019. Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. 99(3), 757–777.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[13]
2019 | Journal Article | IST-REx-ID: 9580 | OA
Conlon D, Fox J, Kwan MA, Sudakov B. 2019. Hypergraph cuts above the average. Israel Journal of Mathematics. 233(1), 67–111.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[12]
2019 | Journal Article | IST-REx-ID: 9585 | OA
Kwan MA, Sudakov B. 2019. Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. 372(8), 5571–5594.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[11]
2018 | Journal Article | IST-REx-ID: 9567 | OA
Krivelevich M, Kwan MA, Loh P, Sudakov B. 2018. The random k‐matching‐free process. Random Structures and Algorithms. 53(4), 692–716.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Journal Article | IST-REx-ID: 9565 | OA
Ferber A, Kwan MA, Sudakov B. 2018. Counting Hamilton cycles in sparse random directed graphs. Random Structures and Algorithms. 53(4), 592–603.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Journal Article | IST-REx-ID: 9568 | OA
Kwan MA, Sudakov B. 2018. Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. 52(2), 181–196.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 9587 | OA
Kwan MA, Sudakov B, Vieira P. 2018. Non-trivially intersecting multi-part families. Journal of Combinatorial Theory Series A. 156, 44–60.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2017 | Journal Article | IST-REx-ID: 9574 | OA
Bandeira AS, Ferber A, Kwan MA. 2017. Resilience for the Littlewood-Offord problem. Electronic Notes in Discrete Mathematics. 61, 93–99.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[6]
2017 | Journal Article | IST-REx-ID: 9590 | OA
Krivelevich M, Kwan MA, Sudakov B. 2017. Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. 31(1), 155–171.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2017 | Journal Article | IST-REx-ID: 9588 | OA
Bandeira AS, Ferber A, Kwan MA. 2017. Resilience for the Littlewood–Offord problem. Advances in Mathematics. 319, 292–312.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2017 | Journal Article | IST-REx-ID: 9589 | OA
Greenhill C, Isaev M, Kwan MA, McKay BD. 2017. The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. 63, 6–25.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[3]
2016 | Journal Article | IST-REx-ID: 9591 | OA
Krivelevich M, Kwan MA, Sudakov B. 2016. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Combinatorics, Probability and Computing. 25(6), 909–927.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Journal Article | IST-REx-ID: 9575 | OA
Krivelevich M, Kwan MA, Sudakov B. 2015. Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electronic Notes in Discrete Mathematics. 49, 181–187.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2014 | Journal Article | IST-REx-ID: 9594 | OA
Greenhill C, Kwan MA, Wind D. 2014. On the number of spanning trees in random regular graphs. The Electronic Journal of Combinatorics. 21(1), P1.45.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Search

Filter Publications