Teaching Responsibilities 2018/19: None
Please note that the university e-mail is inadvisable to be used for any correspondence not related to the university business because of the internal rules concerning GDPR.
theory of combinatorial limits, extremal combinatorics, structural and algorithmic graph theory
Workshop on Structural sparsity, logic and algorithms 2018, 10 Year Anniversary DIMAP Workshop 2017, Workshop in Honour of Mike Paterson's 75th Birthday 2017, Workshop on Algorithms, Logic and Structure 2016, 25th British Combinatorial Conference 2015, LMS-CMI Research school on Regularity and Analytic Methods in Combinatorics 2015, ICMS workshop on extremal combinatorics 2014, CCOSA Winter School 2013, CCOSA Fall School 2011
- L. Esperet, F. Kardoš, A. King, D. Kráľ, S. Norine: Exponentially many perfect matchings in cubic graphs, Advances in Mathematics 227 (2011), 1646-1664.
- D. Kráľ, O. Serra, L. Vena: A Removal Lemma for systems of linear equations over finite fields, Israel Journal of Mathematics 187 (2012), 193-207.
- Z. Dvořák, D. Kráľ, R. Thomas: Deciding first-order properties for sparse graphs, Journal of ACM 60 (2013), article no. 36.
- D. Kráľ, O. Pikhurko: Quasirandom permutations are characterized by 4-point densities, Geometric and Functional Analysis 23 (2013), 570-579.
- D. Kráľ, R. Škrekovski: A Theorem about the Channel Assignment Problem, SIAM Journal on Discrete Mathematics 16 (2003), 426-437.