Vojtěch Rödl

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.

Life and work

Rödl studied from 1968 to 1973 at the Charles University of Prague, where he became a PhD at Zdeněk Hedrlin 1976. Since the early 1990s, he has been a professor at Emory University.

He worked with Jaroslav Nešetřil on Ramsey ( both received for the 1985 State Prize of the Czechoslovak Socialist Republic ) and has published several papers with Paul Erdős. He proposed an algorithm for optimal packings in hypergraphs ago ( Rödl nibble), with whom he proved a conjecture of Paul Erdős in 1985 and Haim Hanani (1963).

In collaboration with Skokan, Mathias Schacht and others, he developed the regularity lemma of Szemerédi Endre further in a version for hypergraphs. Whatever did this by Timothy Gowers.

The Technical University of Liberec Rödl appointed in 2003 an honorary doctorate. In 2012 he was awarded the George Pólya Prize with Schacht, who earned his doctorate at him. He was selected as Plenarsprecher at the International Congress of Mathematicians 2014 in Seoul.

Writings

• With Skokan: Regularity lemma for uniform hyper graphs, 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., Volume 102, 2005, pp. 8109-8113
• With Nagle, Schacht Extremal hypergraph problems and the regularity method, Discrete Mathematics, Volume 26, 2006, pp. 247-278