Iguazu Fall  Hao Huang
  • Email: huanghao at math dot ias dot edu
  • Office address: 
    S-004, Simonyi Hall
    Institute for Advanced Study,
    Princeton, 08540
  • Phone number: (609) 734-8022


About me

I am currently a member in the School of Mathematics at the Institute for Advanced Study for the academic year 2012-2013.


I received my Ph.D degree in Jun, 2012, from Department of Mathematics, UCLA.  My thesis advisor is Professor Benny Sudakov

(Click for a nice photo of our combinatorics group at UCLA) . And I completed my B.S. degree in School of Mathematical Sciences, Peking University in 2007.



Curriculum Vitae (Jun 2012)


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), Combinatorica 32 (2012), 205-219.
  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), Random Structures & Algorithms, 41 (2012), 124-145.
  4. Nonnegative $k$-sums, fractional covers, and probability of small deviations (with N. Alon and B. Sudakov), Journal of Combinatorial Theory, Series B, 102 (2012), 784-796.
  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), Journal of Combinatorial Theory, Series A, 119 (2012), 1200-1215.
  6. The size of a hypergraph and its matching number (with P. Loh, B. Sudakov), Combinatorics, Probability and Computing, 21 (2012), 442-450.
  7. Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs (with J. Ma, A. Shapira, B. Sudakov, and R. Yuster), submitted.
  8. A problem of Erdos on the minimum number of k-cliques (with S. Das, J. Ma, H. Naves, and B. Sudakov), to appear in Journal of Combinatorial Theory, Series B.
  9. On the densities of cliques and independent sets in graphs (with N. Linial, H. Naves, Y. Peled, and B. Sudakov), submitted.
  10. On the 3-local profiles of graphs (with N. Linial, H. Naves, Y. Peled, and B. Sudakov), submitted.
  11. On the maximum induced density of directed stars and related problems, submitted.

Past and forthcoming presentations

Future:

Past:

Teaching


Miscellaneous


Useful Links


Locations of visitors to this page

This webpage was last updated on Jun 12, 2012.