7 citations · 61 across the 41 of their papers we have counts for
6 papers · 1 filter
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…
Supports, regularity, and -infinite divisibility for measures of the form
Hao-Wei Huang
Let be the set of Borel probability measures on . We denote by the absolutely continuous part of . The purpose of this…
Supports of Measures in a free additive convolution semigroup
Hao-Wei Huang
In this paper, we study the supports of measures in the free additive convolution semigroup , where is a Borel probability measure on . We g…
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…
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
Hao Huang, Jie Ma, Asaf Shapira +2
A minimum feedback arc set of a directed graph is a smallest set of arcs whose removal makes acyclic. Its cardinality is denoted by . We show that an Eulerian digraph…