Humberto Naves

activity

20122017

most citedThe threshold probability for long cycles

5 citations · 16 across the 9 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

Maximizing proper colorings on graphs

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…

math.CO2014★ 5 cited

The threshold probability for long cycles

Roman Glebov, Humberto Naves, Benny Sudakov

For a given graph $G$ of minimum degree at least $k$ , let $G_{p}$ denote the random spanning subgraph of $G$ obtained by retaining each edge independently with probability $p = p (k)$ .…

math.CO2014

How unproportional must a graph be?

Humberto Naves, Oleg Pikhurko, Alex Scott

Let $u_{k} (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 binomial random graph wit…