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 almost two years ago.
My full CV can be found here.
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
Three months last year, 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”.
- 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
- Jacob W Cooper, Dan Kráľ, Ander Lamaison, and Samuel Mohr:
Quasirandom Latin squares
Recent and future events
This year so far, I attended the Graph Theory Oberwolfach Meeting as a workshop participant acting as the official video conference assistant to ensure that the meeting ran smoothly in a hybrid mode.
You can find a list of all my organised and visited events and conferences here.