Iguazu Fall  Hao Huang
  • Email: huanghao at math dot ucla dot edu
  • Office address:
    MS 3975, UCLA
    Los Angeles, CA
    90095-1555
  • Office hour for Spring 2011: Thursday 10a-12p
  • Fax: (310) 206-6673


About me

Currently I am a Ph.D. candidate in Department of Mathematics, UCLA. I completed my B.S. degree in School of Mathematical Sciences, Peking University in 2007.

My thesis advisor is Professor Benny Sudakov. I expect to graduate in June 2012.


I am on the job market this year (2011-2012), please click the following links for my CV and research statements.

Curriculum Vitae (Dec 2011)

Research Statement (Oct, 2011)

 


Research interest
My research interest includes extremal combinatorics, probabilistic/algebraic methods, structural graph theory, and theoretical computer science.

For more details, please click on my research statement a few lines above.

Here is a list of my favorite open problems.



Publications & Preprints

  1. A counterexample to the Alon-Saks-Seymour conjecture and related problems (with B. Sudakov), to appear in Combinatorica.
  2. Bandwidth theorem for random graphs (with C. Lee and B. Sudakov), Journal of Combinatorial Theory, Series B 102 (2012), 14-37.
  3. Quasi-randomness of graph balanced cut properties (with C. Lee), to appear in Random Structures & Algorithms.
  4. Nonnegative $k$-sums, fractional covers, and probability of small deviations (with N. Alon and B. Sudakov), to appear in Journal of Combinatorial Theory, Series B.
  5. Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels (with N. Alon, P. Frankl, V. Rodl, A. Rucinski, and B. Sudakov), to appear in Journal of Combinatorial Theory, Series A.
  6. The size of a hypergraph and its matching number (with P. Loh, B. Sudakov), to appear in Combinatorics, Probability and Computing.

Recent presentations


Teaching


Miscellaneous


Useful Links


Locations of visitors to this page

This webpage was last updated on Mar 3, 2011. For old version of my homepage, click here.