Daniel Kráľ

Daniel Kráľ is a Czech mathematician and computer scientist who works as a professor of mathematics and computer science at the University of Warwick. His research primarily concerns graph theory and graph algorithms.[1]

Kráľ won first place and a gold medal at the International Olympiad in Informatics in 1996.[2] He obtained his Ph.D. from Charles University in Prague in 2004, under the supervision of Jan Kratochvíl.[3] 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 Warwick.[1][4]

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.[5] 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.[6][7] 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.[8]

References

  1. 1 2 Curriculum vitae: Daniel Kráľ, retrieved 2015-09-17.
  2. ↑ The Final Results of IOI'96, International Olympiad in Informatics, retrieved 2015-09-17.
  3. ↑ Daniel Kráľ at the Mathematics Genealogy Project
  4. ↑ 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.
  5. ↑ A kombinatorika kiválóságai az Akadémián (in Hungarian), Hungarian Academy of Sciences, September 1, 2011, retrieved 2015-09-17.
  6. ↑ 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, doi:10.1137/080723843, MR 2556543.
  7. ↑ 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, doi:10.1016/j.aim.2011.03.015, MR 2799808.
  8. ↑ Philip Leverhulme Prizes 2014 (PDF), The Leverhulme Trust, retrieved 2015-09-17.

External links

This article is issued from Wikipedia - version of the Sunday, October 25, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.