91福利

Daniel Kr谩木 Professor Joint appointment with Member of the E-mail: D dot Kral at warwick dot ac dot uk (university business only) dkral at fi dot muni dot cz (other professional agenda)

Teaching Responsibilities 2020/21: 

Please note that the e-mail address D dot Kral at warwick dot ac dot uk is inadvisable to be used for any correspondence not related to the business of the 91福利 because of the internal rules concerning GDPR.

---

Research interests:
theory of combinatorial limits, extremal combinatorics, structural and algorithmic graph theory

---

Major research grants:
,

---

Co-organized events
, , , , , , , ,

---

Selected publications

• V. Cohen-Addad, M. Hebdige, D. Kr谩木, Z. Li, E. Salgado: Steinberg's Conjecture is false, Journal of Combinatorial Theory Series B 122 (2017), 452-456.
• J. W. Cooper, D. Kr谩木, T. Martins: Finitely forcible graph limits are universal, Advances in Mathematics 340 (2018), 819-854.
• Z. Dvo艡谩k, D. Kr谩木, R. Thomas: Testing first-order properties for subclasses of sparse graphs, Journal of ACM 60 (2013), article no. 5:36.
• L. Esperet, F. Kardo拧, A. King, D. Kr谩木, S. Norine: Exponentially many perfect matchings in cubic graphs, Advances in Mathematics 227 (2011), 1646-1664.
• R. Glebov, D. Kr谩木, J. Volec: Compactness and finite forcibility of graphons, Journal of the EMS 21 (2019), 3199-3223.
• A. Grzesik, D. Kr谩木, L. M. Lov谩sz: Elusive extremal graphs, Proceedings of the LMS 121 (2020), 1685-1736.
• D. Kr谩木, O. Pikhurko: Quasirandom permutations are characterized by 4-point densities, Geometric and Functional Analysis 23 (2013), 570-579.
• 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.

Further information: , ,