Zdeněk Dvořák (born April 26, 1981) is a Czech mathematician specializing in graph theory.

Dvořák was born in Nové Město na Moravě.[1] He competed on the Czech national team in the 1999 International Mathematical Olympiad,[2] and in the same year in the International Olympiad in Informatics, where he won a gold medal.[3] He earned his Ph.D. in 2007 from Charles University in Prague, under the supervision of Jaroslav Nešetřil. He remained as a research fellow at Charles University until 2010, and then did postdoctoral studies at the Georgia Institute of Technology and Simon Fraser University. He then returned to the Computer Science Institute (IUUK) of Charles University, obtained his habilitation in 2012, and has been a full professor there since 2022.[1]

He was one of three winners of the 2015 European Prize in Combinatorics, "for his fundamental contributions to graph theory, in particular for his work on structural aspects of graph theory, including solutions to Havel's 1969 problem and the Heckman–Thomas 14/5 problem on fractional colourings of cubic triangle-free graphs.[4] This refers to two different results of Dvořák:

  • Havel's conjecture is a strengthening of Grötzsch's theorem. It states that there exists a constant d such that, if a planar graph has no two triangles within distance d of each other, then it can be colored with three colors. A proof of this conjecture of Havel was announced by Dvořák and his co-authors in 2009.[5]
  • C. C. Heckman and Robin Thomas conjectured in 2001 that triangle-free graphs of maximum degree three have fractional chromatic number at most 14/5.[6] A proof was announced by Dvořák and his co-authors in 2013 and published by them in 2014.[7]

References

  1. 1 2 Curriculum vitae: Zdeněk Dvořák (PDF), retrieved 2023-02-10.
  2. ↑ Czech Republic, 40th IMO 1999, International Mathematical Olympiad, retrieved 2015-09-16.
  3. ↑ IOI 1999 Results, International Olympiad in Informatics, retrieved 2015-09-16.
  4. ↑ "The European Prize in Combinatorics", EuroComb 2015, University of Bergen, September 2015, retrieved 2015-09-16.
  5. ↑ Dvořák, Zdeněk; Kráľ, Daniel; Thomas, Robin (2009), Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies, arXiv:0911.0885, Bibcode:2009arXiv0911.0885D.
  6. ↑ Heckman, Christopher Carl; Thomas, Robin (2001), "A new proof of the independence ratio of triangle-free cubic graphs", Discrete Mathematics, 233 (1–3): 233–237, CiteSeerX 10.1.1.138.3764, doi:10.1016/S0012-365X(00)00242-9, MR 1825617.
  7. ↑ Dvořák, Z.; Sereni, J.-S.; Volec, J. (2014), "Subcubic triangle-free graphs have fractional chromatic number at most 14/5", Journal of the London Mathematical Society, Second Series, 89 (3): 641–662, arXiv:1301.5296, doi:10.1112/jlms/jdt085, MR 3217642, S2CID 3188176.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.