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.
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.