Zdeněk Dvořák

from Wikipedia, the free encyclopedia

Zdeněk Dvořák (born April 26, 1981 in Nové Město na Moravě ) is a Czech mathematician and computer scientist.

Zdeněk Dvořák studied mathematics and computer science at the Charles University in Prague with a master's degree in 2004 and a doctorate in 2007 with Jaroslav Nešetřil (dissertation: Asymptotic Structure of Combinatorial Objects ). He was a post-doctoral student at Simon Fraser University and the Georgia Institute of Technology . In 2013 he completed his habilitation in Prague (habilitation thesis: New Techniques in Coloring Embedded Graphs) and became a professor at Charles University.

In 2016 he became editor of the Journal of Combinatorial Theory B.

In 2015 he received the European Prize in Combinatorics for his work in graph theory including the proof of Havel's conjecture and the conjecture by CC Heckman and Robin Thomas that the chromatic number for fractional coloring of a cubic graph without triangles is a maximum of 14/5. Havel's conjecture says that a constant exists, so that a planar graph in which there are no two triangles with a smaller distance can be colored with three colors.

Fonts

  • Z. Dvořák, J.-S. Sereni, J. Volec: Subcubic triangle-free graphs have fractional chromatic number at most 14/5, Journal of the London Mathematical Society, Volume 89, 2014, pp. 641-662, Arxiv

Web links

Individual evidence

  1. ↑ European Prize in Combinatorics 2015
  2. ^ Dvorak, Daniel Kráľ , Robin Thomas: Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies, Arxiv 2009
personal data
SURNAME Dvořák, Zdeněk
BRIEF DESCRIPTION Czech mathematician
DATE OF BIRTH April 26, 1981
PLACE OF BIRTH Nové Město na Moravě