A problem of Erdős on the minimum number of k-cliques. - Shagnik Das; Hao Huang 005; Jie Ma; Humberto Naves; Benny Sudakov (J. Comb. Theory B, 2013)

On the 3-Local Profiles of Graphs. - Hao Huang 005; Nati Linial; Humberto Naves; Yuval Peled; Benny Sudakov (J. Graph Theory, 2014)

Maximizing proper colorings on graphs. - Jie Ma 002; Humberto Naves (J. Comb. Theory B, 2015)

Generating random graphs in biased Maker-Breaker games. - Asaf Ferber; Michael Krivelevich; Humberto Naves (Random Struct. Algorithms, 2015)

Discrepancy of random graphs and hypergraphs. - Jie Ma; Humberto Naves; Benny Sudakov (Random Struct. Algorithms, 2015)

On the densities of cliques and independent sets in graphs. - Hao Huang 005; Nati Linial; Humberto Naves; Yuval Peled; Benny Sudakov (Comb., 2016)

On the Maximum Quartet Distance between Phylogenetic Trees. - Noga Alon; Humberto Naves; Benny Sudakov (SIAM J. Discret. Math., 2016)

The Threshold Probability for Long Cycles. - Roman Glebov; Humberto Naves; Benny Sudakov (Comb. Probab. Comput., 2017)

How unproportional must a graph be? - Humberto Naves; Oleg Pikhurko; Alex Scott 001 (Eur. J. Comb., 2018)