### Basic info

My name is Daniel Král'. I moved to the United Kingdom at the end of September 2012
after accepting a professor position at the University of Warwick.
I work in graph theory and related fields in mathematics and computer science.
Most of my research is now focused on topics related
to my ERC Consolidator grant LADIST,
which builds on the ERC Starting grant CCOSA.
I am also still involved in organizing
the Czech national olympiad in informatics.

### Contact details

E-mail: __kral -at- ucw.cz__

**Office hours:** Tuesday and Thursday 9:00-10:00 (term time) or by appointment.
### Recent and future co-organized events

10 Year Anniversary DIMAP Workshop, December 2017

Workshop in Honour of Mike Paterson's 75th Birthday, December 2017

Workshop on Structural Sparsity, Logic and Algorithms, June 2018

Oberwolfach workshop on Graph Theory, January 2019

The 7th Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2019), May 2019
### Research interests

My research addresses several topics in mathematics, computer science and their interface.
I am primarily interested in problems concerning structural and extremal graph theory, graph algorithms and graph limits.
In particular, the theory of graph limits is a new area of mathematics which provides
analytic tools to study large graphs, e.g., graphs representing social networks.
These analytic methods have also led to new ways to deal with notoriously difficult extremal combinatorics questions and
established new links between analysis, combinatorics, ergodic theory, group theory and probability theory.

Further details, including a short introduction accessible to non-specialists, can be found here.