Short CV

Personal information

• born 1977 in Berlin, Germany
• married, two children

Education

• Habilitation and Venia Legendi for Computer Science, Humboldt University of Berlin, February 2010
• Ph.D. in Mathematics, Emory University, Atlanta, Spring 2004
• M.Sc. in Computer Science, Emory University, Atlanta, Spring 2004
• M.Sc. in Mathematics, Emory University, Atlanta, Fall 2002
• German Vordiplom (B.Sc.) in Business Mathematics, Technical University of Berlin, Summer 1999

Professional experience

• Visiting Professor, Department of Mathematics, Yale University, Fall 2018, 2019, and 2021
• Professor, Department of Mathematics, University of Hamburg, since 2009
• Professor (W3), since 2017
• Associate Professor (W2), 2010-2017
• Visiting Assistant Professor, 2009-2010
• Acting Professor (substituting Prof. H. J. Prömel), Department of Computer Science, Humboldt University of Berlin, 2006-2009
• Postdoctoral Researcher, Department of Computer Science, Humboldt University of Berlin, 2004-2006

Awards and scholarships

• Invited Speaker ICM, 2022
• ERC Consolidator Grant of the European Research Council, 2017-2022
• George Pólya Prize in Combinatorics of the Society for Industrial and Applied Mathematics (SIAM), 2012
• jointly with Vojtěch Rödl for our joint work on generalizing Szemerédi's regularity method to hypergraphs
• Heisenberg Professorship of the German science Foundation (DFG), 2010-2015
• Richard Rado Prize of the Discrete Mathematics section of the German mathematical Society (DMV), 2006
• biennially awarded dissertation prize

Editorial boards

• Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (editor, 2010-2022)
• Discrete Mathematics (associate editor, 2012-2020)
• SIAM Journal on Discrete Mathematics (associate editor, 2017-2022)
• Journal of Combinatorial Theory, Series B (managing editor, 2018-2021)
• Journal of Graph Theory (since 2018)

Selected publications

• Chr. Reiher, V. Rödl, M. Schacht, On a Turán problem in weakly quasirandom 3-uniform hypergraphs, Journal of the European Mathematical Society 20(5), 2018, 1139-1159
• M. Schacht, Extremal results for random discrete structures, Annals of Mathematics 184(2), 2016, 331-363
• D. Conlon, W. T. Gowers, W. Samotij, M. Schacht, On the KŁR conjecture in random graphs, Israel Journal of Mathematics 203(1), 2014, 535-580
• Y. Kohayakawa, V. Rödl, M. Schacht, E. Szemerédi, Sparse partition universal graphs for graphs of bounded degree, Advances in Mathematics 226(6), 2011, 5041-5065
• J. Böttcher, M. Schacht, A. Taraz, Proof of the bandwidth conjecture of Bollobás and Komlós, Mathematische Annalen 343(1), 2009, 175-205
• B. Nagle, V. Rödl, M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures and Algorithms 28(2), 2006, 113-179