About me
My name is Samuel Mohr. I recently finished my PhD studies under the supervision of Prof. Matthias Kriesell at Ilmenau University of Technology. As a postdoc at the Faculty of Informatics of Masaryk University, I work in the Laboratory of Discrete Methods and Algorithms (DIMEA) with the group headed by prof. Daniel Kráľ.
My full CV can be found here.
Research interests
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 current research interests largely focus on the following:
- Limits and Randomness of Combinatorial Objects
- Structural Graph Theory
- Combinatorial Algorithms
Recent Submissions
- Andrzej Grzesik, Daniel Kráľ, and Samuel Mohr:
Strong modeling limits of graphs with bounded tree-width
arXiv: 2103.10354. - Jacob W Cooper, Daniel Kráľ, Ander Lamaison, and Samuel Mohr:
Quasirandom Latin squares
arXiv: 2011.07572. - Jochen Harant and Samuel Mohr:
New bounds on domination and independence in graphs
arXiv: 2008.12601.
Recent and future events
I am co-organising the next IlKe workshop, which will take place online for obvious reasons.
I like to advertise the Round the World Relay in Combinatorics. This is a getting together of a number of seminars and groups in combinatorics around the world.
You can find a list of all my organised and visited events and conferences here.