5 citations · 16 across the 9 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 4 cited
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…
math.CO2012★ 2 cited
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…
math.CO2012
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…