Logo of the University of Passau
Information for... Faculties & facilities
Support Login
Professorship for Discrete Mathematics
Professorship for Discrete Mathematics

Professor Stefan Glock

Professor Stefan Glock

Stefan Glock studied mathematics at Ilmenau University of Technology between 2009 and 2014. Subsequently he became a doctoral student of Daniela Kühn und Deryk Osthus at the University of Birmingham and completed his PhD in 2017. His dissertation "Decompositions of graphs and hypergraphs" was the runner-up for the Richard-Rado-Prize 2018. After two more years as a postdoctoral researcher in Birmingham, Stefan Glock joined the research group of Benny Sudakov at ETH Zurich in 2019. Since September 2022 he holds a tenure-track professorship at the University of Passau. In 2024, he was accepted into the Emmy Noether Programme of the German Research Foundation.

Selected Publications

  • S. Glock, D. Munhá Correia and B. Sudakov. Hamilton cycles in pseudorandom graphs. Advances in Mathematics 458 (2024), 109984.
  • S. Glock, F. Joos, J. Kim, M. Kühn and L. Lichev. Conflict-free hypergraph matchings. Journal of the London Mathematical Society 109 (2024), e12899.
  • S. Glock, D. Kühn, A. Lo and D. Osthus. The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F. Memoirs of the American Mathematical Society 284 (2023), monograph 1406.
  • S. Glock, O. Janzer and B. Sudakov. New results for MaxCut in H-free graphs. Journal of the London Mathematical Society 108 (2023), 441–481.
  • N. Draganić, S. Glock and M. Krivelevich. The largest hole in sparse random graphs. Random Structures & Algorithms 61 (2022), 666–677.
  • M. Bucić, S. Glock and B. Sudakov. The intersection spectrum of 3-chromatic intersecting hypergraphs. Proceedings of the London Mathematical Society 124 (2022), 680–690.
  • S. Glock, F. Joos, J. Kim, D. Kühn and D. Osthus. Resolution of the Oberwolfach problem. Journal of the European Mathematical Society 23 (2021), 2511–2547.
  • S. Glock. Triple systems with no three triples spanning at most five points. Bulletin of the London Mathematical Society 51 (2019), 230–236.

Selected Invited Talks

  • Graph Theory Workshop, Oberwolfach, 10.1.2025

  • Discrete Mathematics Seminar, Princeton, 21.11.2024

  • Plenary talk at KOLKOM, Paderborn, 18.11.2022

  • Combinatorics, Physics and Probability Seminar, Harvard (online), 14.12.2021

  • 8th European Congress of Mathematics, Portorož (online), 24.6.2021

  • Combinatorial Theory Seminar, Oxford, 7.2.2017

Last updated: | Page ID: 151312
Share page
Print page
I agree that a connection to the Vimeo server will be established when the video is played and that personal data (e.g. your IP address) will be transmitted.
I agree that a connection to the YouTube server will be established when the video is played and that personal data (e.g. your IP address) will be transmitted.
Show video