5 citations · 16 across the 9 of their papers we have counts for
10 papers
Making spanning graphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +2
We prove that for each there exists such that whenever , in the Maker-Breaker game played on , Maker has a s…
On the maximum quartet distance between phylogenetic trees
Noga Alon, Humberto Naves, Benny Sudakov
A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on leaves is at most . Using the mac…
Maximizing proper colorings on graphs
Jie Ma, Humberto Naves
The number of proper -colorings of a graph , denoted by , is an important graph parameter that plays fundamental role in graph theory, computational complexity theory…
The threshold probability for long cycles
Roman Glebov, Humberto Naves, Benny Sudakov
For a given graph of minimum degree at least , let denote the random spanning subgraph of obtained by retaining each edge independently with probability .…
How unproportional must a graph be?
Humberto Naves, Oleg Pikhurko, Alex Scott
Let be the maximum over all -vertex graphs of by how much the number of induced copies of in differs from its expectation in the binomial random graph wit…
Generating random graphs in biased Maker-Breaker games
Asaf Ferber, Michael Krivelevich, Humberto Naves
We present a general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs. We utilize this approach to prove new results and also to…
Discrepancy of random graphs and hypergraphs
Jie Ma, Humberto Naves, Benny Sudakov
Answering in a strong form a question posed by Bollobás and Scott, in this paper we determine the discrepancy between two random k-uniform hypergraphs, up to a constant factor depe…
On the densities of cliques and independent sets in graphs
Hao Huang, Nati Linial, Humberto Naves +2
Let r, s >= 2 be integers. Suppose that the number of blue r-cliques in a red/blue coloring of the edges of the complete graph K_n is known and fixed. What is the largest possible…
On the 3-local profiles of graphs
Hao Huang, Nati Linial, Humberto Naves +2
For a graph G, let p_i(G), i=0,...,3 be the probability that three distinct random vertices span exactly i edges. We call (p_0(G),...,p_3(G)) the 3-local profile of G. We investiga…
A problem of Erdős on the minimum number of -cliques
Shagnik Das, Hao Huang, Jie Ma +2
Fifty years ago Erdős asked to determine the minimum number of -cliques in a graph on vertices with independence number less than l. He conjectured that this minimum is achi…