My name is Samuel Mohr. As a postdoc at the Faculty of Informatics of Masaryk University, I worked in the Laboratory of Discrete Methods and Algorithms (DIMEA) with the group headed by prof. Daniel Kráľ. I finished my PhD studies under the supervision of Prof. Matthias Kriesell at Ilmenau University of Technology roughly three years ago.
My full CV can be found here.
My PhD thesis was entitled Rooted structures in graphs : a project on Hadwiger's conjecture, rooted minors, and Tutte cycles. You can find it published here, and you can download a PDF copy.
At Masaryk University, I started to work on extremal combinatorics. My research interests largely focused on the following:
- Combinatorial Algorithms
- Structural Graph Theory
- Limits and Randomness of Combinatorial Objects
In 2021, I worked as a short-term scholar supervised by Prof. Florian Pfender at University of Colorado Denver. The research project was about “Exploring Flag Algebra Methods to Study Minors in Graphs”.
- Christoph Brause, Jochen Harant, Florian Hörsch, and Samuel Mohr:
Spanning trees of smallest maximum degree in subdivisions of graphs
- Matija Bucić, Jacob W. Cooper, Dan Kráľ, Samuel Mohr, and David C. Munhá:
Uniform Turán density of cycles
- Andrzej Grzesik, Dan Kráľ, and Samuel Mohr:
Strong modeling limits of graphs with bounded tree-width
Recent and future events
I decided to quit academia in summer 2022. I had a great time doing research in mathematics and theoretical computer science and appreciate every person I was allowed to meet. You might still see me from time to time on conferences and at universities. Stay safe and stay connected: samuel-mohr.de
For the record, here is a list of all my organised and visited events and conferences.