default search action
Hao Huang 0005
Person information
- affiliation: National University of Singapore
- affiliation (former): Emory University, Department of Mathematics, Atlanta, GA, USA
- affiliation (PhD 2012): University of California Los Angeles, Department of Mathematics, Los Angeles, CA, USA
Other persons with the same name
- Hao Huang — disambiguation page
- Hao Huang 0001
— Wuhan University, School of Computer Science, China
- Hao Huang 0002 — University of Southern California, Department of Electrical Engineering, Los Angeles, CA, USA
- Hao Huang 0003
- Hao Huang 0004 — Southwest Jiaotong University, School of Transportation and Logistics, China
- Hao Huang 0006
- Hao Huang 0007 — GE Global Research, San Ramon, CA, USA (and 1 more)
- Hao Huang 0008
- Hao Huang 0009
- Hao Huang 0010 — Huazhong University of Science and Technology, School of Software Engineering, Wuhan, China (and 1 more)
- Hao Huang 0011
- Hao Huang 0012
- Hao Huang 0013
- Hao Huang 0014
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Lixing Fang, Hao Huang, János Pach, Gábor Tardos, Junchi Zuo:
Successive vertex orderings of fully regular graphs. J. Comb. Theory A 199: 105776 (2023) - 2021
- [j19]Peter Frankl, Hao Huang, Vojtech Rödl:
On local Turán problems. J. Comb. Theory A 177: 105329 (2021) - 2020
- [j18]Alexander Clifton, Hao Huang:
On Almost k-Covers of Hypercubes. Comb. 40(4): 511-526 (2020) - [j17]Hao Huang, Oleksiy Klurman, Cosmin Pohoata:
On subsets of the hypercube with prescribed Hamming distances. J. Comb. Theory A 171 (2020)
2010 – 2019
- 2019
- [j16]Hao Huang:
Two extremal problems on intersecting families. Eur. J. Comb. 76: 1-9 (2019) - 2018
- [j15]Peter Frankl, Jie Han, Hao Huang, Yi Zhao
A degree version of the Hilton-Milner theorem. J. Comb. Theory A 155: 493-502 (2018) - 2017
- [j14]Hao Huang, Yi Zhao:
Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture. J. Comb. Theory A 150: 233-247 (2017) - [j13]Noga Alon, Tom Bohman
More on the Bipartite Decomposition of Random Graphs. J. Graph Theory 84(1): 45-52 (2017) - 2016
- [j12]Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the densities of cliques and independent sets in graphs. Comb. 36(5): 493-512 (2016) - 2014
- [j11]Hao Huang, Benny Sudakov:
The Minimum Number of Nonnegative Edges in Hypergraphs. Electron. J. Comb. 21(3): 3 (2014) - [j10]Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the 3-Local Profiles of Graphs. J. Graph Theory 76(3): 236-248 (2014) - [j9]Noga Alon, Harout K. Aydinian, Hao Huang:
Maximizing the Number of Nonnegative Subsets. SIAM J. Discret. Math. 28(2): 811-816 (2014) - 2013
- [j8]Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov, Raphael Yuster:
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. Comb. Probab. Comput. 22(6): 859-873 (2013) - [j7]Shagnik Das
A problem of Erdős on the minimum number of k-cliques. J. Comb. Theory B 103(3): 344-373 (2013) - 2012
- [j6]Hao Huang, Benny Sudakov:
A counterexample to the Alon-Saks-Seymour conjecture and related problems. Comb. 32(2): 205-219 (2012) - [j5]Hao Huang, Po-Shen Loh
The Size of a Hypergraph and its Matching Number. Comb. Probab. Comput. 21(3): 442-450 (2012) - [j4]Hao Huang, Choongbum Lee, Benny Sudakov:
Bandwidth theorem for random graphs. J. Comb. Theory B 102(1): 14-37 (2012) - [j3]Noga Alon, Hao Huang, Benny Sudakov:
Nonnegative k-sums, fractional covers, and probability of small deviations. J. Comb. Theory B 102(3): 784-796 (2012) - [j2]Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Comb. Theory A 119(6): 1200-1215 (2012) - [j1]Hao Huang, Choongbum Lee:
Quasi-randomness of graph balanced cut properties. Random Struct. Algorithms 41(1): 124-145 (2012) - 2010
- [i2]Hao Huang, Choongbum Lee:
Quasi-randomness of graph balanced cut properties. CoRR abs/1009.2307 (2010) - [i1]Hao Huang, Benny Sudakov:
A counterexample to the Alon-Saks-Seymour conjecture and related problems. Electron. Colloquium Comput. Complex. TR10 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: