#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2012

2018

- This year (1)
- Last 5 years (11)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov
- J. Comb. Theory, Ser. B
- 2013

Fifty years ago Erdős asked to determine the minimum number of k-cliques in a graph on n vertices with independence number less than l. He conjectured that this minimum is achieved by the disjoint… (More)

- Asaf Ferber, Michael Krivelevich, Humberto Naves
- Random Struct. Algorithms
- 2015

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 derive some known… (More)

- Hao Huang, Nathan Linial, Humberto Naves, Yuval Peled, Benny Sudakov
- Combinatorica
- 2016

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 Kn is known and fixed. What is the largest possible number of red… (More)

- Roman Glebov, Humberto Naves, Benny Sudakov
- Combinatorics, Probability & Computing
- 2017

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 ≥ log… (More)

- Hao Huang, Nathan Linial, Humberto Naves, Yuval Peled, Benny Sudakov
- Journal of Graph Theory
- 2014

For a graph G, let pi(G), i = 0, ..., 3 be the probability that three distinct random vertices span exactly i edges. We call (p0(G), ..., p3(G)) the 3-local profile of G. We investigate the set S3 ⊂… (More)

- Noga Alon, Humberto Naves, Benny Sudakov
- SODA
- 2016

A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on n leaves is at most ( 2 3 +o(1)) (n 4 ) . Using the machinery of flag algebras, we… (More)

- Jie Ma, Humberto Naves
- J. Comb. Theory, Ser. B
- 2015

The number of proper q-colorings of a graph G, denoted by PG(q), is an important graph parameter that plays fundamental role in graph theory, computational complexity theory and other related fields.… (More)

- Jie Ma, Humberto Naves, Benny Sudakov
- Random Struct. Algorithms
- 2015

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 depending solely on k.

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… (More)

- Humberto Naves, Oleg Pikhurko, Alex D. Scott
- Eur. J. Comb.
- 2018

Let uk(G, p) be the maximum over all k-vertex graphs F of by how much the number of induced copies of F in G differs from its expectation in the Erdős-Rényi random graph with edge probability p. This… (More)