Daniel Kráľ
Daniel Kráľ (born June 30, 1978 in Zlín ) is a Czech mathematician and computer scientist who specializes in graph theory.
Kráľ studied mathematics and computer science at the Charles University in Prague with a master's degree in computer science in 2001 and a doctorate in 2004 with Jan Kratochvíl . As a post-doctoral student he was at the TU Berlin and at the Georgia Institute of Technology (Fulbright Scholar and visiting professor). In 2012 he completed his habilitation in Prague and in the same year became professor at the University of Warwick .
He proved a conjecture by Michael D. Plummer and László Lovász from the 1970s that every bridge-free cubic graph has an exponential number (in terms of the number of nodes) of perfect matchings .
In 2011 he won the European Prize in Combinatorics . In 2014 he received the Philip Leverhulme Prize in Mathematics and Statistics and in 2010 an ERC Starting Grant.
In 2017 he became editor of the SIAM Journal of Discrete Mathematics.
Fonts
- D. Král, J.-S. Sereni, M. Stiebitz: A new lower bound on the number of perfect matchings in cubic graphs, SIAM Journal on Discrete Mathematics, Volume 23, 2009, pp. 1465-1483
- L. Esperet, F. Kardoš, A. King, D. Král, S. Norine: Exponentially many perfect matchings in cubic graphs, Advances in Mathematics, Volume 227, 2011, pp. 1646–1664,
source
Web links
- Literature and other media by and about Daniel Kráľ in the catalog of the National Library of the Czech Republic
| personal data | |
|---|---|
| SURNAME | Kráľ, Daniel |
| BRIEF DESCRIPTION | Czech mathematician and computer scientist |
| DATE OF BIRTH | June 30, 1978 |
| PLACE OF BIRTH | Zlín |