My name is Daniel Král'. I have recently moved to the Faculty of Informatics of Masaryk University in Brno, Czech Republic, where I have been the inaugural holder of the newly established Donald Ervin Knuth Professorship, which the university has created with the permission of Donald Knuth. I am also co-heading the Laboratory of Discrete Methods and Algorithms (DIMEA) of the Faculty. Before moving to Brno, I was a professor of mathematics and computer science at the University of Warwick and I am still partially affiliated with Warwick and its research centre DIMAP. My research work concerns 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 involved in organizing the Czech national olympiad in informatics.
Advances in Combinatorics is a new overlay combinatorial journal, which follows a model established by the journal Discrete Analysis for diamond open access. The journal has no printed copies; instead the journal provides links to the published versions of the articles on arXiv. So, the journal is free to read for everybody!
The journal aims at providing a diamond open access journal at the level of the very top combinatorial journals. The initial editorial board consists of Béla Bollobás, Reinhard Diestel, Timothy Gowers, Dan Král', Daniela Kühn, James Oxley, Bruce Reed, Gábor Sárközy, Asaf Shapira and Robin Thomas, with Tim and myself also acting as the managing editors. The financial and administrative support for the journal is provided by Queen's University Library. The journal now welcomes its first submissions, which can be made through the Scholastica editorial system, and intends to publish its first articles early in 2019.
Additional information on ethical journals and the launch of this journal can be found in this blog post by Tim Gowers.
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.