We stand with Ukraine  

Hao Huang

Affiliations:
  • National University of Singapore
  • Emory University, Department of Mathematics, Atlanta, GA, USA (former)
  • University of California Los Angeles, Department of Mathematics, Los Angeles, CA, USA (PhD 2012)


According to our database1, Hao Huang authored at least 20 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Successive vertex orderings of fully regular graphs.
[BibTeX]
[DOI]
Lixing Fang
,
Hao Huang
,
János Pach
,
Gábor Tardos
,
Junchi Zuo
J. Comb. Theory A, 2023

2021
On local Turán problems.
[BibTeX]
[DOI]
Peter Frankl
,
Hao Huang
,
Vojtech Rödl
J. Comb. Theory A, 2021

2020
On subsets of the hypercube with prescribed Hamming distances.
[BibTeX]
[DOI]
Hao Huang
,
Oleksiy Klurman
,
Cosmin Pohoata
J. Comb. Theory A, 2020

On Almost k-Covers of Hypercubes.
[BibTeX]
[DOI]
Alexander Clifton
,
Hao Huang
Comb., 2020

2019
Two extremal problems on intersecting families.
[BibTeX]
[DOI]
Hao Huang
Eur. J. Comb., 2019

2018
A degree version of the Hilton-Milner theorem.
[BibTeX]
[DOI]
Peter Frankl
,
Jie Han
,
Hao Huang
,
Yi Zhao
J. Comb. Theory A, 2018

2017
More on the Bipartite Decomposition of Random Graphs.
[BibTeX]
[DOI]
Noga Alon
,
Tom Bohman
,
Hao Huang
J. Graph Theory, 2017

Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture.
[BibTeX]
[DOI]
Hao Huang
,
Yi Zhao
J. Comb. Theory A, 2017

2016
On the densities of cliques and independent sets in graphs.
[BibTeX]
[DOI]
Hao Huang
,
Nati Linial
,
Humberto Naves
,
Yuval Peled
,
Benny Sudakov
Comb., 2016

2014
Maximizing the Number of Nonnegative Subsets.
[BibTeX]
[DOI]
Noga Alon
,
Harout K. Aydinian
,
Hao Huang
SIAM J. Discret. Math., 2014

On the 3-Local Profiles of Graphs.
[BibTeX]
[DOI]
Hao Huang
,
Nati Linial
,
Humberto Naves
,
Yuval Peled
,
Benny Sudakov
J. Graph Theory, 2014

The Minimum Number of Nonnegative Edges in Hypergraphs.
[BibTeX]
[DOI]
Hao Huang
,
Benny Sudakov
Electron. J. Comb., 2014

2013
A problem of Erdős on the minimum number of k-cliques.
[BibTeX]
[DOI]
Shagnik Das
,
Hao Huang
,
Jie Ma
,
Humberto Naves
,
Benny Sudakov
J. Comb. Theory B, 2013

Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs.
[BibTeX]
[DOI]
Hao Huang
,
Jie Ma
,
Asaf Shapira
,
Benny Sudakov
,
Raphael Yuster
Comb. Probab. Comput., 2013

2012
Quasi-randomness of graph balanced cut properties.
[BibTeX]
[DOI]
Hao Huang
,
Choongbum Lee
Random Struct. Algorithms, 2012

Bandwidth theorem for random graphs.
[BibTeX]
[DOI]
Hao Huang
,
Choongbum Lee
,
Benny Sudakov
J. Comb. Theory B, 2012

Nonnegative k-sums, fractional covers, and probability of small deviations.
[BibTeX]
[DOI]
Noga Alon
,
Hao Huang
,
Benny Sudakov
J. Comb. Theory B, 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.
[BibTeX]
[DOI]
Noga Alon
,
Peter Frankl
,
Hao Huang
,
Vojtech Rödl
,
Andrzej Rucinski
,
Benny Sudakov
J. Comb. Theory A, 2012

The Size of a Hypergraph and its Matching Number.
[BibTeX]
[DOI]
Hao Huang
,
Po-Shen Loh
,
Benny Sudakov
Comb. Probab. Comput., 2012

2010
A counterexample to the Alon-Saks-Seymour conjecture and related problems.
[BibTeX]
[DOI]
Hao Huang
,
Benny Sudakov
Electron. Colloquium Comput. Complex., 2010


  Loading...