Daniel Kráľ

Professor Daniel Kráľ is the Alexander von Humboldt Professor for Discrete Mathematics at Leipzig University since April 2025, affiliated with the Max Planck Institute for Mathematics in the Sciences. Previously, he held the Donald Ervin Knuth Professorship at Masaryk University (2018–2025) and was a professor at the University of Warwick (2012–2020). He also serves as an honorary professor at Warwick and has held visiting roles at UC Berkeley (2025) and Georgia Tech (2005–2006). His research focuses on combinatorics, graph theory, and their intersections with computer science, particularly in extremal combinatorics, graph limits, and algorithmic graph theory.

Education: Ph.D. in Computer Science (2004), Master's (2001) from Charles University, Prague. Early career included postdoc roles at TU Berlin and Charles University's Institute for Theoretical Computer Science.

Research Interests: Theory of combinatorial limits, extremal combinatorics, structural and algorithmic graph theory, analytic methods in discrete mathematics. Key contributions include resolving Steinberg's Conjecture and Lovász-Plummer Conjecture, development of graph limit theory, and applications to algorithm design.

Grants & Awards: Recipient of ERC Starting (CCOSA) and Consolidator (LADIST) grants, SIAM Fellowship (2024), AMS Fellow (2020), Philip Leverhulme Prize (2014), European Prize in Combinatorics (2011). Over 150 journal articles, with impactful work in Advances in Mathematics, Journal of the EMS, and others.

Service: Editor-in-Chief of SIAM Journal on Discrete Mathematics, co-editor of Journal of Combinatorial Theory, co-founder of Advances in Combinatorics. Organized major conferences and workshops, including the 2025 Oberwolfach workshop on Graph Theory.

Labs/Teams: Leading research groups in discrete mathematics at Leipzig and previously in Brno/Warwick. Collaborates with postdocs and students on projects spanning graph limits, integer programming, and combinatorial optimization.