Iguazu Fall  Hao Huang
  • Email: huanghao at math dot ias dot edu

  • Office address at IAS:
    S-004, Simonyi Hall
    Institute for Advanced Study,
    Princeton, 08540
     
  • Office address at DIMACS:
    Core Building 407, Busch campus, Rutgers University.

Click for MATH 453: Theory of Linear Optimization I am teaching in Fall 2013 at Rutgers University.


About me

I am currently a postdoctoral member at the School of Mathematics at Institute for Advanced Study and DIMACS at Rutgers University. This year I am co-organizing the Rutgers discrete mathematics seminar, please contact me if you are interested in giving a talk.


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.


I am on the academic job market this year. Please see my CV and research statement below, and send me an email if you are interested in my application.


Curriculum Vitae (Oct, 2013)


Research Statement (Oct, 2013)

 


Research interest


My research interest includes extremal combinatorics, probabilistic/algebraic methods, spectral graph theory, 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.


Co-authors:

Noga Alon, Shagnik Das, Peter Frankl, Choongbum Lee, Nati Linial, Po-Shen Loh, Jie Ma, Humberto Naves,Yuval Peled, Vojtech Rodl, Andrzej Rucinski, Asaf Shapira, Benny Sudakov, Raphy Yuster.


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), Combinatorics, Probability and Computing, 22 (2013), 859-873.
  8. A problem of Erdos on the minimum number of k-cliques (with S. Das, J. Ma, H. Naves, and B. Sudakov), Journal of Combinatorial Theory, Series B, 103 (2013), 344-373.
  9. On the densities of cliques and independent sets in graphs (with N. Linial, H. Naves, Y. Peled, and B. Sudakov), to appear in Combinatorica.
  10. On the 3-local profiles of graphs (with N. Linial, H. Naves, Y. Peled, and B. Sudakov), to appear in Journal of Graph Theory.
  11. On the maximum induced density of directed stars and related problems, to appear in SIAM Journal on Discrete Mathematics.
  12. The minimum number of nonnegative edges in hypergraphs (with B. Sudakov), submitted.
  13. Maximizing the number of nonnegatives subsets (with N. Alon, H. Aydinian), to appear in SIAM Journal on Discrete Mathematics.

Recent talks


Teaching


Miscellaneous


Useful Links


This webpage was last updated on Oct 24, 2013.