| 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 | 34 | 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 | 31 | 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 | 21 | 2016 |
| Generating random graphs in biased Maker‐Breaker games A Ferber, M Krivelevich, H Naves Random Structures & Algorithms 47 (4), 615-634, 2015 | 21 | 2015 |
| The threshold probability for long cycles R Glebov, H Naves, B Sudakov Combinatorics, Probability and Computing 26 (2), 208-247, 2017 | 12 | 2017 |
| On the maximum quartet distance between phylogenetic trees N Alon, H Naves, B Sudakov SIAM Journal on Discrete Mathematics 30 (2), 718-735, 2016 | 12 | 2016 |
| Maximizing proper colorings on graphs J Ma, H Naves Journal of Combinatorial Theory, Series B 115, 236-275, 2015 | 11 | 2015 |
| Making spanning graphs P Allen, J Böttcher, Y Kohayakawa, H Naves, Y Person arXiv preprint arXiv:1711.05311, 2017 | 8 | 2017 |
| Discrepancy of random graphs and hypergraphs J Ma, H Naves, B Sudakov Random Structures & Algorithms 47 (1), 147-162, 2015 | 3 | 2015 |
| How unproportional must a graph be? H Naves, O Pikhurko, A Scott European Journal of Combinatorics 73, 138-152, 2018 | 1 | 2018 |
| On Combinatorial Problems of Extremal Nature and Games HS Naves UCLA, 2014 | | 2014 |
