HNHumberto Naves

Humberto Naves

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Humberto Naves has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • How unproportional must a graph be?

    by Humberto Naves, Oleg Pikhurko, Alex Scott


  • Open Access

    Making spanning graphs

    by Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Humberto Naves, Yury Person

    We prove that for each $D\ge 2$ there exists $c>0$ such that whenever $b\le c\big(\tfrac{n}{\log n}\big)^{1/D}$, in the $(1:b)$ Maker-Breaker game played on $E(K_n)$, Maker has a strategy to guarantee claiming a graph $G$ containing copies of all graphs $H$ with $v(H)\le n$ and $\Delta(H)\le D$. We show further that the graph $G$ guaranteed by this strategy also contains copies of any graph $H$ with bounded maximum degree and degeneracy at most $\tfrac{D-1}{2}$. This lower bound on the threshold bias is sharp up to the $\log$-factor when $H$ consists of $\tfrac{n}{3}$ vertex-disjoint triangles or $\tfrac{n}{4}$ vertex-disjoint $K_4$-copies.

  • Open Access

    The Threshold Probability for Long Cycles

    by Roman Glebov, Humberto Naves, Benny Sudakov

    For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G obtained by retaining each edge independently with probability p = p(k). We prove that if p ⩾ (logk + loglogk + ωk(1))/k, where ωk(1) is any function tending to infinity with k, then Gp asymptotically almost surely contains a cycle of length at least k + 1. When we take G to be the complete graph on k + 1 vertices, our theorem coincides with the classic result on the threshold probability for the existence of a Hamilton cycle in the binomial random graph.


  • Open Access

    On the maximum quartet distance between phylogenetic trees

    by Noga Alon, Humberto Naves, Benny Sudakov

    A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on $n$ leaves is at most $(\frac 23 +o(1))\binom{n}{4}$. Using the machinery of flag algebras we improve the currently known bounds regarding this conjecture, in particular we show that the maximum is at most $(0.69 +o(1))\binom{n}{4}$. We also give further evidence that the conjecture is true by proving that the maximum distance between caterpillar trees is at most $(\frac 23 +o(1))\binom{n}{4}$.

  • Open Access

    Maximizing proper colorings on graphs

    by Jie Ma, Humberto Naves

    The number of proper $q$-colorings of a graph $G$, denoted by $P_G(q)$, is an important graph parameter that plays fundamental role in graph theory, computational complexity theory and other related fields. We study an old problem of Linial and Wilf to find the graphs with $n$ vertices and $m$ edges which maximize this parameter. This problem has attracted much research interest in recent years, however little is known for general $m,n,q$. Using analytic and combinatorial methods, we characterize the asymptotic structure of extremal graphs for fixed edge density and $q$. Moreover, we disprove a conjecture of Lazebnik, which states that the Tur\'{a}n graph $T_s(n)$ has more $q$-colorings than any other graph with the same number of vertices and edges. Indeed, we show that there are infinite many counterexamples in the range $q = O({s^2}/{\log s})$. On the other hand, when $q$ is larger than some constant times ${s^2}/{\log s}$, we confirm that the Tur\'{a}n graph $T_s(n)$ asymptotically is the extremal graph achieving the maximum number of $q$-colorings. Furthermore, other (new and old) results on various instances of the Linial-Wilf problem are also established.