| On perfect matchings in uniform hypergraphs with large minimum vertex degree H Hàn, Y Person, M Schacht SIAM Journal on Discrete Mathematics 23 (2), 732-748, 2009 | 123 | 2009 |
| Dirac-type results for loose Hamilton cycles in uniform hypergraphs H Hàn, M Schacht Journal of Combinatorial Theory, Series B 100 (3), 332-346, 2010 | 83 | 2010 |
| Weak quasi‐randomness for uniform hypergraphs D Conlon, H Hàn, Y Person, M Schacht Random Structures & Algorithms 40 (1), 1-38, 2012 | 65 | 2012 |
| Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs E Buß, H Han, M Schacht Journal of Combinatorial Theory, Series B 103 (6), 658-678, 2013 | 61 | 2013 |
| Blow-up lemmas for sparse graphs P Allen, J Böttcher, H Hàn, Y Kohayakawa, Y Person arXiv preprint arXiv:1612.00622, 2016 | 53 | 2016 |
| Quasi-randomness and algorithmic regularity for graphs with general degree distributions N Alon, A Coja-Oghlan, H Hàn, M Kang, V Rödl, M Schacht SIAM Journal on Computing 39 (6), 2336-2362, 2010 | 39 | 2010 |
| Quasirandomness in hypergraphs E Aigner-Horev, D Conlon, H Hàn, Y Person, M Schacht Electronic Notes in Discrete Mathematics 61, 13-19, 2017 | 30 | 2017 |
| Powers of Hamilton cycles in pseudorandom graphs P Allen, J Böttcher, H Hàn, Y Kohayakawa, Y Person Combinatorica 37, 573-616, 2017 | 23 | 2017 |
| Improved bound on the maximum number of clique-free colorings with two and three colors H Hàn, A Jiménez SIAM Journal on Discrete Mathematics 32 (2), 1364-1368, 2018 | 16 | 2018 |
| Maximum number of sum-free colorings in finite abelian groups H Hàn, A Jiménez Israel Journal of Mathematics 226 (2), 505-534, 2018 | 14 | 2018 |
| Erdős–Ko–Rado for random hypergraphs: asymptotics and stability MM Gauy, H Han, IC Oliveira Combinatorics, Probability and Computing 26 (3), 406-422, 2017 | 14 | 2017 |
| Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles S Bustamante, H Hàn, M Stein Journal of Graph Theory 91 (1), 5-15, 2019 | 12 | 2019 |
| Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs H Han, J Han, Y Zhao Journal of Combinatorial Theory, Series B 153, 105-148, 2022 | 11 | 2022 |
| A sharp threshold for van der Waerden's theorem in random subsets E Friedgut, H Hàn, Y Person, M Schacht arXiv preprint arXiv:1512.05921, 2015 | 11 | 2015 |
| Maximum number of triangle-free edge colourings with five and six colours F Botler, J Corsten, A Dankovics, N Frankl, H Hàn, A Jiménez, J Skokan Acta Mathematica Universitatis Comenianae 88 (3), 495-499, 2019 | 10 | 2019 |
| Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs H Han, J Han, P Morris Random Structures & Algorithms 61 (1), 101-125, 2022 | 9 | 2022 |
| Quasi-randomness and algorithmic regularity for graphs with general degree distributions N Alon, A Coja-Oghlan, H Hàn, M Kang, V Rödl, M Schacht Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007 | 8 | 2007 |
| Quasi-random words and limits of word sequences H Hán, M Kiwi, M Pavez-Signé European Journal of Combinatorics 98, 103403, 2021 | 7 | 2021 |
| Note on strong refutation algorithms for random k-SAT formulas H Hàn, Y Person, M Schacht Electronic Notes in Discrete Mathematics 35, 157-162, 2009 | 5 | 2009 |
| Ramsey-type numbers involving graphs and hypergraphs with large girth H Hàn, T Retter, V Rödl, M Schacht Electronic Notes in Discrete Mathematics 50, 457-463, 2015 | 4* | 2015 |
