Contact Info
Curriculum Vitae: CV |

- N. Alon, H. Naves, and B. Sudakov,
On the maximum quartet distance
between phylogenetic trees, SIAM J. of Discrete Math.
**30**(2016), 718-735.

A preliminary version appeared in: Proc. of the 27th Annual ACM-SIAM SODA, ACM Press (2016), 2095-2106. . - J. Ma, and H. Naves,
Maximizing proper
colorings on graphs,
J. Combinatorial Theory Ser. B.
**115**(2015) 236-275. - R. Glebov, H. Naves, and B. Sudakov, The threshold probability for long cycles, submitted.
- H. Naves, and O. Pikhurko, How unproportional must a graph be?, submitted.
- A. Ferber, M. Krivelevich, and H. Naves, Generating random graphs in biased Maker-Breaker games, submitted.
- H. Huang, N. Linial, H. Naves, Y. Peled, and B. Sudakov,
On the 3-local profiles
of graphs, J. Graph Theory
**76**(2013) 236-248. - J. Ma, H. Naves, and B. Sudakov, Discrepancy of random graphs and hypergraphs, Random Structures and Algorithms, to appear.
- H. Huang, N. Linial, H. Naves, Y. Peled, and B. Sudakov, On the densities of cliques and independent sets in graphs, Combinatorica, to appear.
- S. Das, H. Huang, J. Ma, H. Naves, and B. Sudakov,
A problem of Erdos
on the minimum number of k-cliques,
J. Combinatorial Theory Ser. B
**103**(2013) 344-373.

- Aug 2015 -
The threshold probability for long cycles - ICIAM 2015. - Apr 2015 -
The maximum number of proper colorings of graphs - AMS Spring Western Sectional Meeting. - Nov 2014 -
Tic-tac-toe games on graphs - Field of Dreams Conference. - Oct 2014 -
The threshold probability for long cycles - ACO seminar at CMU. - Apr 2014 -
Densities of cliques and independent sets in graphs - Seminar at UZH, Zurich. - Feb 2014 -
Generating random graphs in biased Maker-Breaker games - Seminar at University of Warwick. - Sep 2013 -
The maximum number of q-colorings in graphs - Seminar at ETH Zurich. - Aug 2013 -
Discrepancy of random graphs and hypergraphs - Random Structures and Algorithms (RSA), Poznan. - Nov 2012 -
Shifting in graphs - Combinatorics seminar at Georgia Tech. - Aug 2012 -
Densities of cliques and independent sets in graphs - New Trends and Directions in Combinatorics, BIRS, Banff. - Apr 2012 -
Flag algebras and k-cliques - Graduate Student Combinatorics Conference, UIUC. - Feb 2012 -
On a problem of Erdös on the minimal number of k-cliques , Candidacy Talk, UCLA.