| Almost all Steiner triple systems have perfect matchings M Kwan Proceedings of the London Mathematical Society 121 (6), 1468-1495, 2020 | 30 | 2020 |
| Bounded-degree spanning trees in randomly perturbed graphs M Krivelevich, M Kwan, B Sudakov SIAM Journal on Discrete Mathematics 31 (1), 155-171, 2017 | 30 | 2017 |
| Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs M Krivelevich, M Kwan, B Sudakov Combinatorics, Probability and Computing 25 (6), 909-927, 2016 | 30 | 2016 |
| The average number of spanning trees in sparse graphs with given degrees C Greenhill, M Isaev, M Kwan, BD McKay European Journal of Combinatorics 63, 6-25, 2017 | 15 | 2017 |
| Anticoncentration for subgraph statistics M Kwan, B Sudakov, T Tran Journal of the London Mathematical Society 99 (3), 757-777, 2019 | 11 | 2019 |
| Dense induced bipartite subgraphs in triangle-free graphs M Kwan, S Letzter, B Sudakov, T Tran Combinatorica, 1-23, 2020 | 9 | 2020 |
| Intercalates and discrepancy in random Latin squares M Kwan, B Sudakov Random Structures & Algorithms 52 (2), 181-196, 2018 | 9 | 2018 |
| Nearly-linear monotone paths in edge-ordered graphs M Bucić, M Kwan, A Pokrovskiy, B Sudakov, T Tran, AZ Wagner Israel Journal of Mathematics, 1-23, 2020 | 8 | 2020 |
| Halfway to Rota’s basis conjecture M Bucić, M Kwan, A Pokrovskiy, B Sudakov International Mathematics Research Notices 2020 (21), 8007-8026, 2020 | 7 | 2020 |
| Almost all Steiner triple systems are almost resolvable A Ferber, M Kwan Forum of Mathematics, Sigma 8, 2020 | 7 | 2020 |
| Hypergraph cuts above the average D Conlon, J Fox, M Kwan, B Sudakov Israel Journal of Mathematics 233 (1), 67-111, 2019 | 7 | 2019 |
| Combinatorial anti-concentration inequalities, with applications J Fox, M Kwan, L Sauermann arXiv preprint arXiv:1905.12142, 2019 | 7 | 2019 |
| The random k‐matching‐free process M Krivelevich, M Kwan, PS Loh, B Sudakov Random Structures & Algorithms 53 (4), 692-716, 2018 | 7 | 2018 |
| Non-trivially intersecting multi-part families M Kwan, B Sudakov, P Vieira Journal of Combinatorial Theory, Series A 156, 44-60, 2018 | 7 | 2018 |
| Proof of a conjecture on induced subgraphs of Ramsey graphs M Kwan, B Sudakov Transactions of the American Mathematical Society 372 (8), 5571-5594, 2019 | 6 | 2019 |
| On the number of spanning trees in random regular graphs C Greenhill, M Kwan, D Wind Electronic Journal of Combinatorics 21 (1), 2014 | 6 | 2014 |
| Anti-concentration for subgraph counts in random graphs J Fox, M Kwan, L Sauermann The Annals of Probability 49 (3), 1515-1553, 2021 | 4 | 2021 |
| Ramsey graphs induce subgraphs of quadratically many sizes M Kwan, B Sudakov International Mathematics Research Notices 2020 (6), 1621-1638, 2020 | 4 | 2020 |
| Universality of random permutations X He, M Kwan Bulletin of the London Mathematical Society 52 (3), 515-529, 2020 | 2 | 2020 |
| An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs M Kwan, L Sauermann arXiv preprint arXiv:1909.02089, 2019 | 2 | 2019 |
Benjamin SudakovETH, ZurichVerified email at math.ethz.ch
