Research

• Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
  Random Structures and Algorithms,
  with J. Han and P. Morris (an extended abstract appeared in SODA 2020).

• Quasi-random words and limits of word sequences
  European Journal of Combinatorics, (accepted)
  with M. Kiwi and M. Pavez-Signé.

• Dirac type theorem for (k/2)-Hamilton cycle in k-uniform hypergraphs
  Journal of Combinatorial Theory (B), (accepted)
  with J. Han and Y. Zhao

• Ramsey numbers involving graphs and hypergraphs with large girth
  Combinatorics, Probability and Computing 30 (5), 722-740, 2021
  with T. Retter, V. Rödl, and M. Schacht.

• Linear quasirandomness for subsets of abelian groups and hypergraphs
  European Journal of Combinatorics, 88, 2020
  with E. Aigner-Horev.

• Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight cycles
  Journal of Graph Theory, 91(1), 5-15, 2019
  with S. Bustamante and M. Stein.

• Quasirandomness for hypergraphs
  Electronic Journal of Combinatorics, P3.34, 2018
  with D. Conlon, E. Aigner-Horev, H. Hàn, Y. Person and M. Schacht.

• Improved bound on the maximum number of clique-free colorings with two and three colors
  SIAM Journal on Discrete Mathematics, 32(2), 1364-1368, 2018
  with A. Jiménez.

• Maximum number of sum-free colorings in abelian groups
  Israel Journal of Mathematics, 226(2), 505-534, 2018
  with A. Jiménez.

• Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs
  SIAM Journal on Discrete Mathematics, 32(2), 826-838, 2018
  with V. Rödl and T. Szábo.

• Powers of Hamilton cycles in pseudorandom graphs
  Combinatorica, 37(4), 573-616, 2017
  with P. Allen, J. Böttcher, Y. Kohayakawa, Y. Person.

• Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
  Combinatorics, Probability and Computing, 26(3), 406-422, 2017
  with M. Gauy and I. Oliveira.

• Polynomial configurations in subsets of random and pseudo-random sets
  Journal of Number Theory, 165, 363-381, 2016
  with E. Aigner-Horev.

• Sharp threshold for van der Waerden's theorem in random subsets of Zn
  Discrete Analysis 2016:7
  with E. Friedgut, Y. Person, and M. Schacht

• Extremal results for odd cycles in sparse pseudorandom graphs
  Combinatorica, 34(4), 379-406, 2014
  with E. Aigner-Horev and M. Schacht.

• Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
  Journal of Combinatorial Theory (B) 103(6): 658-678, 2013
  E. Buß and M. Schacht.

• Weak quasi-randomness for uniform hypergraphs
  Random Structures and Algorithms, 40(1), 1-38, 2012
  with D. Conlon, Y. Person, and M. Schacht.

• Quasi-randomness and algorithmic regularity for graphs with general degree distribution
  SIAM Journal on Computing 39(6), 2336-2362, 2010
  with N. Alon, A. Coja-Oghlan, M. Kang, V. Rödl and M. Schacht.

• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
  Journal of Combinatorial Theory (B) 100(3), 332-346, 2009
  with M. Schacht.

• On perfect matchings in uniform hypergraphs with large minimum vertex degree
  SIAM Journal on Discrete Mathematics, 23(2), 732-748, 2009
  with Y. Person and M. Schacht.

TBA