Vojtěch Rödl

Vojtěch Rödl (born 1 April 1949[1]) is a Czech American mathematician, currently the Samuel Candler Dobbs Professor at Emory University in Atlanta, known for his work in combinatorics.

Education and career

Rödl received his Ph.D. from Charles University, Prague in 1976; his advisor was Zdeněk Hedrlín. Significant contributions include his work with Jaroslav Nešetřil on Ramsey theory, his proof of the Erdős–Hanani conjecture on hypergraph packing[2] and his development, together with Brendan Nagle, Mathias Schacht, and Jozef Skokan (and independently of Timothy Gowers), of the hypergraph regularity lemma.[3][4]

In 2012, Rödl and his former student Schacht were awarded the George Pólya Prize by the Society for Industrial and Applied Mathematics, for their work on hypergraph regularity.[5]

Books
  • Nešetřil, Jaroslav; Rödl, Vojtěch (1991). Mathematics of Ramsey Theory. Algorithms and Combinatorics. 5. Springer. ISBN 0-387-18191-1.
gollark: ÇÇ? ÓÇ.
gollark: Loaning out?
gollark: You can get these nice small LCDs/OLEDs for them.
gollark: I've tried to get other cool SBCs like the Rock64/RockPro64 (from Pine64), but unfortunately they're not very available in the Uk.
gollark: That'd be quite simple to do.

See also

References
  1. "Foreign Fellows of the Learned Society : Rödl Vojtěch". Learned Society of the Czech Republic.
  2. Vojtěch Rödl: On a packing and covering problem, European Journal of Combinatorics, 6 (1985), 69–78.
  3. Vojtěch Rödl, Jozef Skokan: Regularity lemma for uniform hypergraphs, Random Structures & Algorithms, 25 (2004), 1–42.
  4. Brendan Nagle, Vojtěch Rödl, Mathias Schacht: The Counting Lemma for regular k-uniform hypergraphs, Random Structures & Algorithms, 28 (2006), 113–179
  5. "George Pólya Prize in Applied Combinatorics".
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.