Warwick University campus Prague Castle and Charles Bridge Petrov hill in Brno


Picture

Basic info

My name is Daniel Kráľ. 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 co-heading the Laboratory of Discrete Methods and Algorithms (DIMEA) of the Faculty. I am also honorary professor at the University of Warwick, where, before moving to Brno, I was a professor of mathematics and computer science at the University of Warwick and was also affiliated its research centre DIMAP.

My research addresses several topics in mathematics, computer science and their interface. Most of my research is focused on topics related to my (now past) ERC Consolidator grant LADIST, which built on the ERC Starting grant CCOSA. These include problems concerning structural and extremal graph theory, graph algorithms and graph limits. In particular, the theory of graph limits, which was also the main subject of Lovász's Abel Prize Lecture, is a new area of mathematics which provides analytic tools to study large graphs, e.g., graphs representing social networks. These analytic methods have 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 on my research work, including a short introduction accessible to non-specialists, can be found here.

Contact details

E-mail: dkral -at- fi.muni.cz
Office: C517, main FI building

Teaching in the academic year 2021/22

MA010 Graph Theory
IV119 Seminar on Discrete Mathematical Methods
IV131 Seminar of Discrete Methods and Algorithms (DIMEA) Laboratory

I am also responsible for organizing the colloquia of the Faculty of Informatics.

Recent and future co-organized events

Advances in Combinatorics

Advances in Combinatorics is an overlay combinatorial journal, which follows a model established by the journal Discrete Analysis for diamond open access. The journal aims to be a diamond open access journal at the level of the very top combinatorial journals. It has no printed copies; instead the journal provides links to the published versions of the articles on arXiv. The journal is a member of the Free Journal Network, indexed by MathSciNet and Scopus, and also listed in the Directory of Open Access Journals.

The journal Advances in Combinatorics was launched in June 2018 and the first papers were published in October 2019. During its first three and half years of existence, the journal has received 149 submissions, out of which 27 have been accepted for publication and additional 12 are currently under review. The average initial decision time (excluding desk rejects) is 7 months (as of February 2022).

The editorial board currently consists of Béla Bollobás, Julia Böttcher, Maria Chudnovsky, Louis Esperet, Timothy Gowers, James Oxley, Woljciech Samotij, Gábor Sárközy, Alex Scott and Asaf Shapira, with Louis, Tim and myself also acting as the managing editors of the journal. The financial and administrative support for the journal is provided by Queen's University Library.

Additional information on the aims of the journal and ethical publishing in general can be found in this blog post and this blog post by Tim Gowers.

Personal statement on the Plan S

While I am a proud supporter of open access publishing, in particular, in its diamond form, I do not support implementation of the Plan S for several reasons including those expressed in this statement by the ERC Scientific Council.

I wish that scientific publishing moves further towards the diamond open access model as represented by the journals Advances in Combinatorics, Discrete Analysis, Electronic Journal of Combinatorics, and a more recently established journal TheoretiCS.