| Induced subgraphs of hypercubes and a proof of the sensitivity conjecture H Huang Annals of Mathematics 190 (3), 949-955, 2019 | 185 | 2019 |
| Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels N Alon, P Frankl, H Huang, V Rödl, A Ruciński, B Sudakov Journal of Combinatorial Theory, Series A 119 (6), 1200-1215, 2012 | 137 | 2012 |
| The size of a hypergraph and its matching number H Huang, PS Loh, B Sudakov Combinatorics, Probability and Computing 21 (03), 442-450, 2012 | 125 | 2012 |
| Nonnegative k-sums, fractional covers, and probability of small deviations N Alon, H Huang, B Sudakov Journal of Combinatorial Theory, Series B 102 (3), 784-796, 2012 | 61 | 2012 |
| A counterexample to the Alon-Saks-Seymour conjecture and related problems H Huang, B Sudakov Combinatorica 32 (2), 205-219, 2012 | 53 | 2012 |
| Bandwidth theorem for random graphs H Huang, C Lee, B Sudakov Journal of Combinatorial Theory, Series B 102 (1), 14-37, 2012 | 42 | 2012 |
| A problem of Erdős on the minimum number of k-cliques S Das, H Huang, J Ma, H Naves, B Sudakov Journal of Combinatorial Theory, Series B 103 (3), 344-373, 2013 | 35 | 2013 |
| On the 3‐Local Profiles of Graphs H Huang, N Linial, H Naves, Y Peled, B Sudakov Journal of Graph Theory 76 (3), 236-248, 2014 | 33 | 2014 |
| On the densities of cliques and independent sets in graphs H Huang, N Linial, H Naves, Y Peled, B Sudakov Combinatorica 36 (5), 493-512, 2016 | 23 | 2016 |
| On the maximum induced density of directed stars and related problems H Huang SIAM Journal on Discrete Mathematics 28 (1), 92-98, 2014 | 22 | 2014 |
| Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs H Huang, J Ma, A Shapira, B Sudakov, R Yuster Combinatorics, Probability and Computing 22 (06), 859-873, 2013 | 22 | 2013 |
| On graphs decomposable into induced matchings of linear sizes J Fox, H Huang, B Sudakov Bulletin of the London Mathematical Society 49 (1), 45-57, 2017 | 20 | 2017 |
| Degree versions of the Erdős–Ko–Rado theorem and Erdős hypergraph matching conjecture H Huang, Y Zhao Journal of Combinatorial Theory, Series A 150, 233-247, 2017 | 18 | 2017 |
| On almost k-covers of hypercubes A Clifton, H Huang Combinatorica 40 (4), 511-526, 2020 | 16 | 2020 |
| The minimum number of nonnegative edges in hypergraphs H Huang, B Sudakov arXiv preprint arXiv:1309.2549, 2013 | 15 | 2013 |
| More on the bipartite decomposition of random graphs N Alon, T Bohman, H Huang Journal of Graph Theory 84 (1), 45-52, 2017 | 14 | 2017 |
| Two extremal problems on intersecting families H Huang European Journal of Combinatorics 76, 1-9, 2019 | 13 | 2019 |
| On tight cycles in hypergraphs H Huang, J Ma SIAM Journal on Discrete Mathematics 33 (1), 230-237, 2019 | 13 | 2019 |
| On subsets of the hypercube with prescribed Hamming distances H Huang, O Klurman, C Pohoata Journal of Combinatorial Theory, Series A 171, 105156, 2020 | 11 | 2020 |
| A degree version of the Hilton–Milner theorem P Frankl, J Han, H Huang, Y Zhao Journal of Combinatorial Theory, Series A 155, 493-502, 2018 | 11 | 2018 |
