Daniel Kráľ

Daniel Kráľ (born June 30, 1978) is a Czech mathematician and computer scientist who works as a professor of mathematics and computer science at the Masaryk University. His research primarily concerns graph theory and graph algorithms.[1]

Daniel Král
Born (1978-06-30) June 30, 1978
Alma materCharles University, Prague
AwardsEuropean Prize in Combinatorics (2011), Philip Leverhulme Prize in Mathematics and Statistics (2014), Fellow of the American Mathematical Society (2020)
Scientific career
FieldsMathematician
InstitutionsMasaryk University, Brno
ThesisComputational Complexity and Graph Theory Graph Coloring Problems (2004)
Doctoral advisorJan Kratochvíl

Education and career

He obtained his Ph.D. from Charles University in Prague in 2004, under the supervision of Jan Kratochvíl.[2] After short-term positions at TU Berlin, Charles University, and the Georgia Institute of Technology, he returned to Charles University as a researcher in 2006, and became a tenured associate professor there in 2010. He was awarded the degree of Doctor of Science by the Academy of Sciences of the Czech Republic in 2012, and in the same year moved to a professorship at the University of Warwick.[1][3]

In 2018, Kráľ moved back to the Czech Republic and started working at Faculty of Informatics, Masaryk University, accepting the Donald Knuth professorship chair.[4][5][6]

Contributions

In the 1970s, Michael D. Plummer and László Lovász conjectured that every bridgeless cubic graph has an exponential number of perfect matchings, strengthening Petersen's theorem that at least one perfect matching exists. In a pair of papers with different sets of co-authors, Kráľ was able to show that this conjecture is true.[7][8]

Recognition

Kráľ won first place and a gold medal at the International Olympiad in Informatics in 1996.[9]

In 2011, Kráľ won the European Prize in Combinatorics for his work in graph theory, particularly citing his solution to the Plummer–Lovász conjecture and his results on graph coloring.[10] In 2014, he won a Philip Leverhulme Prize in Mathematics and Statistics; the award citation again included Kráľ's research on the Plummer–Lovász conjecture, as well as other publications of Kráľ on pseudorandom permutations and systems of equations.[11]

He was elected as a Fellow of the American Mathematical Society in the 2020 Class, for "contributions to extremal combinatorics and graph theory, and for service to the profession".[12]

References
  1. Curriculum vitae: Daniel Kráľ, retrieved 2015-09-17.
  2. Daniel Kráľ at the Mathematics Genealogy Project
  3. Daniel Kral joins the Department of Computer Science as a new Professor, University of Warwick Department of Computer Science, October 18, 2012, retrieved 2015-09-17.
  4. "Personal Page prof. RNDR. Daniel Kráľ, Ph.D., DSC".
  5. Svobodová, Ivana. "Král diskrétních čísel". Týdeník Respekt. Retrieved 2020-01-14.
  6. "Dan Král". www.ucw.cz. Retrieved 2020-01-14.
  7. Král, Daniel; Sereni, Jean-Sébastien; Stiebitz, Michael (2009), "A new lower bound on the number of perfect matchings in cubic graphs", SIAM Journal on Discrete Mathematics, 23 (3): 1465–1483, CiteSeerX 10.1.1.147.4983, doi:10.1137/080723843, MR 2556543, S2CID 1642894.
  8. Esperet, Louis; Kardoš, František; King, Andrew D.; Král, Daniel; Norine, Serguei (2011), "Exponentially many perfect matchings in cubic graphs", Advances in Mathematics, 227 (4): 1646–1664, arXiv:1012.2878, doi:10.1016/j.aim.2011.03.015, MR 2799808, S2CID 4401537.
  9. The Final Results of IOI'96, International Olympiad in Informatics, retrieved 2015-09-17.
  10. A kombinatorika kiválóságai az Akadémián (in Hungarian), Hungarian Academy of Sciences, September 1, 2011, archived from the original on November 6, 2013, retrieved 2015-09-17.
  11. Philip Leverhulme Prizes 2014 (PDF), The Leverhulme Trust, archived from the original (PDF) on 2018-02-07, retrieved 2015-09-17.
  12. 2020 Class of the Fellows of the AMS, American Mathematical Society, retrieved 2019-11-03
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.