Humberto Naves

According to our database, Humberto Naves authored at least 9 papers between 2013 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2018

How unproportional must a graph be?

Humberto Naves, Oleg Pikhurko, Alex Scott

Eur. J. Comb., 2018

2017

The Threshold Probability for Long Cycles.

Roman Glebov, Humberto Naves, Benny Sudakov

Comb. Probab. Comput., 2017

2016

On the Maximum Quartet Distance between Phylogenetic Trees.

Noga Alon, Humberto Naves, Benny Sudakov

SIAM J. Discret. Math., 2016

On the densities of cliques and independent sets in graphs.

Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov

Comb., 2016

2015

Discrepancy of random graphs and hypergraphs.

Jie Ma, Humberto Naves, Benny Sudakov

Random Struct. Algorithms, 2015

Generating random graphs in biased Maker-Breaker games.

Asaf Ferber, Michael Krivelevich, Humberto Naves

Random Struct. Algorithms, 2015

Maximizing proper colorings on graphs.

Jie Ma, Humberto Naves

J. Comb. Theory B, 2015

2014

On the 3-Local Profiles of Graphs.

Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov

J. Graph Theory, 2014

2013

A problem of Erdős on the minimum number of k-cliques.

Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov

J. Comb. Theory B, 2013