Vojtěch Rödl

from Wikipedia, the free encyclopedia

Vojtěch Rödl (born April 1, 1949 ) is a Czech mathematician who deals with combinatorics . He is a professor at Emory University in Atlanta , Georgia .

Live and act

Rödl studied from 1968 to 1973 at the Charles University in Prague and received his doctorate there in 1976 under Zdeněk Hedrlin . He has been a professor at Emory University since the early 1990s.

He worked with Jaroslav Nešetřil on Ramsey theory (both received the CSSR State Prize in 1985) and published several articles with Paul Erdős . He proposed an algorithm for optimal packing in hypergraphs (Rödl nibble), with which he proved a conjecture by Paul Erdős and Haim Hanani (1963) in 1985.

In collaboration with Skokan, Mathias Schacht and others, he further developed Endre Szemerédi’s regularity lemma in a version for hypergraphs . Timothy Gowers did the same independently .

The Technical University of Liberec awarded Rödl an honorary doctorate in 2003. In 2012 he received the George Pólya Prize with Shaft, which he did his doctorate with. He was selected as plenary speaker at the International Congress of Mathematicians 2014 in Seoul (Quasi-randomness and the regularity method in hypergraphs).

Fonts

  • with Skokan: Regularity lemma for uniform hypergraphs , Random Structures & Algorithms, Volume 25, 2004, pp. 1-42
  • with B. Nagle, Y. Kohayakawa, M. Schacht, J. Skokan The hypergraph regularity method and its applications , Proc. Nat. Acad. Sci., Vol. 102, 2005, pp. 8109-8113
  • with Nagle, Schacht Extremal hypergraph problems and the regularity method , Discrete Mathematics, Volume 26, 2006, pp. 247-278
  • with Nagle, Schacht The Counting Lemma for regular k-uniform hypergraphs , Random Structures & Algorithms, Volume 28, 2006, pp. 113-179

Web links

Individual evidence

  1. ^ Mathematics Genealogy Project
  2. ^ Rödl On a packing and covering problem , European J. Combinatorics, Volume 6, 1985, pp. 69-78
  3. http://tuni.tul.cz/prilohy/rodl.doc