Humberto Naves

11 papers A* 1Journal 10
YearRankTypeTitle / Venue / Authors
2018 J jnl
How unproportional must a graph be?
Eur. J. Comb.
Humberto Naves, Oleg Pikhurko, Alex Scott
2017 J jnl
The Threshold Probability for Long Cycles.
Comb. Probab. Comput.
Roman Glebov, Humberto Naves, Benny Sudakov
2016 J jnl
On the Maximum Quartet Distance between Phylogenetic Trees.
SIAM J. Discret. Math.
Noga Alon, Humberto Naves, Benny Sudakov
2016 J jnl
On the densities of cliques and independent sets in graphs.
Comb.
Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov
2016 A* conf
On the maximum quartet distance between phylogenetic trees.
SODA
Noga Alon, Humberto Naves, Benny Sudakov
2015 J jnl
Discrepancy of random graphs and hypergraphs.
Random Struct. Algorithms
Jie Ma, Humberto Naves, Benny Sudakov
2015 J jnl
Generating random graphs in biased Maker-Breaker games.
Random Struct. Algorithms
Asaf Ferber, Michael Krivelevich, Humberto Naves
2015 J jnl
Maximizing proper colorings on graphs.
J. Comb. Theory B
Jie Ma, Humberto Naves
2015 J jnl
On the maximum quartet distance between phylogenetic trees.
CoRR
Noga Alon, Humberto Naves, Benny Sudakov
2014 J jnl
On the 3-Local Profiles of Graphs.
J. Graph Theory
Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov
2013 J jnl
A problem of Erdős on the minimum number of k-cliques.
J. Comb. Theory B
Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov