Instituto de Matemática e Estatística

Universidade de São Paulo

e-mail: hh(at)ime.usp.br

I am a post-doctoral researcher of the Computer Science Department Computer Science Department at the Institute for Mathematics and Statistic , USP and a visiting faculty member of the Department of Mathematics and Computer Science, Emory University. My areas of interest include extremal combinatorics, random and quasi-random discrete structures, probabilistic methods, algorithms & complexity and some topics in additive combinatorics. I defended my PhD in 2010 at the Department of Computer Science, Humboldt University. My supervisor was Mathias Schacht. Before coming to São Paulo I also spent one year at the Department of Mathematics, University of Hamburg.

- Powers of Hamilton cycles in pseudorandom graphs

(with P. Allen, J. Böttcher, Y. Kohayakawa and Y. Person)

to appear in*Combinatorica*. - Extremal results for odd cycles in sparse pseudorandom graphs

(with E. Aigner-Horev and M. Schacht)

*Combinatorica*, 34(4), 379-406, 2014 - Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

(with E. Buß and M. Schacht)

*Journal of Combinatorial Theory Series (B)*, 103(6), 658-678, 2013 - Weak quasi-randomness for uniform hypergraphs

(with D. Conlon, Y. Person, and M. Schacht)

*Random Structures and Algorithms*40(1), 1-38, 2012 - Quasi-randomness and algorithmic regularity for graphs with general
degree distributions

(with N. Alon, A. Coja-Oghlan, M. Kang, V. Rödl and M. Schacht)

*SIAM Journal on Computing*39(6), 2336-2362, 2010. - Dirac-type results for loose Hamilton cycles in uniform hypergraphs

(with M. Schacht)*Journal of Combinatorial Theory (B)*100(3), 332-346, 2010

- On perfect matchings in uniform hypergraphs with large minimum vertex degree

(with Y. Person and M. Schacht)*SIAM Journal on Discrete Mathematics*23(2), 732-748, 2009

- On two point configurations with polynomial gaps in subsets of
random and pseudorandom sets

(with E. Aigner-Horev); submitted - Erdős-Ko-Rado for random hypergraphs: asymptotics and stability

(with M. Gauy and I. Oliveira); submitted - Sharp threshold for van der Waerden's theorem in random subsets of Zn

(with E. Friedgut, Y. Person and M. Schacht) preprint;

abstract presented at Erdős Centennial 2013 - A Blow-up Lemma for random and pseudo-random graphs

(with P. Allen, J. Böttcher, Y. Kohayakawa and Y. Person); preprint (75 pages)

extended abstract accepted in LAGOS 2013

- Ramsey numbers involving graphs and hypergraphs with large girth

(with T. Retter, V. Rödl and M. Schacht); preprint

extended abstract accepted in LAGOS 2015 - Spectral stability for the partition function of the hard-core model

(with P. Tetali) preprint;

- Arithmetic progressions of length 3 with pseudorandom gaps in Fnp

(with E. Aigner-Horev); preprint - Dirac type theorem for (k/2)-Hamilton cycle in k-uniform hypergraphs

(with J. Han and Y. Zhao); preprint

- Ramsey numbers involving graphs and hypergraphs with large girth

(with T. Retter, V. Rödl and M. Schacht)

accepted in LAGOS 2015 - Powers of Hamilton cycles in pseudorandom graphs

(with P. Allen, J. Böttcher, Y. Kohayakawa and Y. Person)

LATIN 2014

- An approximate blow-up lemma for sparse random graphs

(with P. Allen, J. Böttcher, Y. Kohayakawa and Y. Person)

LAGOS 2013 - On two points configurations in pseudorandom subsets of the integers

(with Elad Aigner-Horev)

Eurocomb13

- Extremal results for odd cycles in sparse pseudorandom graphs

(with E. Aigner-Horev and M. Schacht)

LAGOS 2013

- Minimum vertex degree conditions for loose Hamilton cycles in
3-uniform hypergraphs

(with E. Buss and M. Schacht)

Proceedings of EuroComb 2011, vol. 38 series Electron. Notes Discrete Math., 207-212 - Note on forcing pairs

(with Y. Person and M. Schacht)

Proceedings of EuroComb 2011, vol. 38 series Electron. Notes Discrete Math., 437-442 - Note on strong refutation algorithms for random k-SAT formulas

(with Y. Person and M. Schacht)

Proceedings of LAGOS 2009, vol. 35 series.*Electron. Notes Discrete Math.*157-162

- Quasi-randomness and algorithmic regularity for graphs with general
degree distributions

(with N Alon, A. Coja-Oghlan, M. Kang, V. Rödl and M. Schacht)

Automata, Languages and Programming, 34th International Colloquium, ICALP 2007,

Wroclaw, Poland, vol. 4596 series Lecture Notes in Computer Science, 789-800