A counterexample to the Alon-Saks-Seymour conjecture and related problems. - Hao Huang 005; Benny Sudakov (Electron. Colloquium Comput. Complex., 2010)

The Size of a Hypergraph and its Matching Number. - Hao Huang 005; Po-Shen Loh; Benny Sudakov (Comb. Probab. Comput., 2012)

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. - Noga Alon; Peter Frankl; Hao Huang 005; Vojtech Rödl; Andrzej Rucinski 001; Benny Sudakov (J. Comb. Theory A, 2012)

Nonnegative k-sums, fractional covers, and probability of small deviations. - Noga Alon; Hao Huang 005; Benny Sudakov (J. Comb. Theory B, 2012)

Bandwidth theorem for random graphs. - Hao Huang 005; Choongbum Lee; Benny Sudakov (J. Comb. Theory B, 2012)

Quasi-randomness of graph balanced cut properties. - Hao Huang 005; Choongbum Lee (Random Struct. Algorithms, 2012)

Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. - Hao Huang 005; Jie Ma; Asaf Shapira; Benny Sudakov; Raphael Yuster (Comb. Probab. Comput., 2013)

A problem of Erdős on the minimum number of k-cliques. - Shagnik Das; Hao Huang 005; Jie Ma; Humberto Naves; Benny Sudakov (J. Comb. Theory B, 2013)

The Minimum Number of Nonnegative Edges in Hypergraphs. - Hao Huang 005; Benny Sudakov (Electron. J. Comb., 2014)

On the 3-Local Profiles of Graphs. - Hao Huang 005; Nati Linial; Humberto Naves; Yuval Peled; Benny Sudakov (J. Graph Theory, 2014)

Maximizing the Number of Nonnegative Subsets. - Noga Alon; Harout K. Aydinian; Hao Huang 005 (SIAM J. Discret. Math., 2014)

On the densities of cliques and independent sets in graphs. - Hao Huang 005; Nati Linial; Humberto Naves; Yuval Peled; Benny Sudakov (Comb., 2016)

Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture. - Hao Huang 005; Yi Zhao 005 (J. Comb. Theory A, 2017)

More on the Bipartite Decomposition of Random Graphs. - Noga Alon; Tom Bohman; Hao Huang 005 (J. Graph Theory, 2017)

A degree version of the Hilton-Milner theorem. - Peter Frankl; Jie Han 002; Hao Huang 005; Yi Zhao 005 (J. Comb. Theory A, 2018)

Two extremal problems on intersecting families. - Hao Huang 005 (Eur. J. Comb., 2019)

On Almost k-Covers of Hypercubes. - Alexander Clifton; Hao Huang 005 (Comb., 2020)

On subsets of the hypercube with prescribed Hamming distances. - Hao Huang 005; Oleksiy Klurman; Cosmin Pohoata (J. Comb. Theory A, 2020)

On local Turán problems. - Peter Frankl; Hao Huang 005; Vojtech Rödl (J. Comb. Theory A, 2021)

Successive vertex orderings of fully regular graphs. - Lixing Fang; Hao Huang 005; János Pach; Gábor Tardos; Junchi Zuo (J. Comb. Theory A, 2023)