# Hao Huang

Mathematician and computer scientist

## Hao Huang 's AcademicInfluence.com Rankings

## Download Badge

Mathematics Computer Science

## Hao Huang 's Degrees

- Bachelors Mathematics Peking University

## Similar Degrees You Can Earn

## Why Is Hao Huang Influential?

(Suggest an Edit or Addition)According to Wikipedia, Hao Huang is a mathematician known for solving the sensitivity conjecture. Huang is currently an associate professor in the mathematics department at National University of Singapore. Huang was an assistant professor from 2015 to 2021 in the Department of Mathematics at Emory University. He obtained his Ph.D in mathematics from UCLA in 2012 advised by Benny Sudakov. His postdoctoral research was done at the Institute for Advanced Study in Princeton and DIMACS at Rutgers University in 2012-2014, followed by a year at the Institute for Mathematics and its Applications at University of Minnesota.

## Hao Huang 's Published Works

### Published Works

- Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels (2011) (115)
- The Size of a Hypergraph and its Matching Number (2011) (106)
- Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture (2019) (101)
- Nonnegative k-sums, fractional covers, and probability of small deviations (2011) (52)
- Bandwidth theorem for random graphs (2010) (43)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (2010) (41)
- A problem of Erdős on the minimum number of k-cliques (2012) (33)
- Supports of Measures in a free additive convolution semigroup (2012) (26)
- On the 3‐Local Profiles of Graphs (2012) (18)
- On the Maximum Induced Density of Directed Stars and Related Problems (2013) (18)
- An analogue of the L\'{e}vy-Hin\v{c}in formula for bi-free infinitely divisible distributions (2015) (17)
- The Minimum Number of Nonnegative Edges in Hypergraphs (2013) (15)
- Analytic aspects of the bi-free partial R-transform (2016) (14)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (2016) (14)
- Two extremal problems on intersecting families (2018) (13)
- On graphs decomposable into induced matchings of linear sizes (2015) (13)
- A degree version of the Hilton-Milner theorem (2017) (12)
- On the densities of cliques and independent sets in graphs (2012) (12)
- Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs (2012) (10)
- More on the Bipartite Decomposition of Random Graphs (2014) (9)
- On Almost k-Covers of Hypercubes (2019) (9)
- Large Supports are required for Well-Supported Nash Equilibria (2015) (8)
- Maximizing the Number of Nonnegative Subsets (2013) (7)
- Limit theorems in bi-free probability theory (2017) (5)
- Supports, regularity, and $\boxplus$-infinite divisibility for measures of the form $(μ^{\boxplus p})^{\uplus q}$ (2012) (5)
- A note on the double-critical graph conjecture (2016) (5)
- On subsets of the hypercube with prescribed Hamming distances (2018) (5)
- On the supports of measures in free multiplicative convolution semigroups (2014) (5)
- Harmonic analysis for the bi-free partial S-transform (2017) (5)
- Quasi‐randomness of graph balanced cut properties (2010) (4)
- Bandwidth theorem for sparse graphs (2010) (4)
- Matrices Whose Norms Are Determined by Their Actions on Decreasing Sequences (2008) (4)
- Bi-free extreme values (2018) (3)
- On the support of measures in multiplicative free convolution semigroups (2013) (3)
- On Tight Cycles in Hypergraphs (2017) (3)
- Limit Theorems and Wrapping Transforms in Bi-free Probability Theory (2020) (2)
- Rainbow Matchings in Properly-Colored Hypergraphs (2018) (2)
- Deterministic bootstrap percolation in high dimensional grids (2013) (2)
- On local Turán problems (2021) (2)
- Characterization of the matrix whose norm is determined by its action on decreasing sequences (2007) (2)
- Regularity results for free Lévy processes (2022) (1)
- Various Problems in Extremal Combinatorics (2012) (1)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (2012) (0)
- On the supports of measures in free multiplicative convolution semigroups (2014) (0)
- On the supports of measures in free additive and multiplicative semigroups (2013) (0)
- Closability property of operator algebras generated by normal operators and operators of class $C_0$ (2011) (0)
- A problem of Erd\H{o}s on the minimum number of $k$-cliques (2012) (0)
- Successive vertex orderings of fully regular graphs (2022) (0)
- C O ] 1 1 M ay 2 01 1 Quasi-randomness of graph balanced cut properties (2018) (0)
- Perturbative and non-perturbative aspectsof Chern-Simons (2014) (0)
- On the densities of cliques and independent sets in graphs (2015) (0)
- A non-uniform extension of Baranyai's Theorem (2022) (0)
- Linear orderings of the edges of a graph (2022) (0)
- On local Tur\'an problems (2020) (0)
- Large Supports are Required for Well-Supported (2015) (0)
- Extremal problems in Eulerian digraphs (2012) (0)

This paper list is powered by the following services:

## Other Resources About Hao Huang

## What Schools Are Affiliated With Hao Huang ?

Hao Huang is affiliated with the following schools: