Vojtěch Rödl
From Infogalactic: the planetary knowledge core
Vojtěch Rödl is a Czech mathematician, currently the Samuel Candler Dobbs Professor at Emory University, Atlanta, known for his work in combinatorics. He received his PhD from Charles University, Prague in 1976. Significant contributions include his work with Jaroslav Nešetřil on Ramsey theory, his proof of the Erdős–Hanani conjecture on hypergraph packing [1] and his development, together with Nagle, Schacht and Skokan (and independently of Gowers), of the hypergraph regularity lemma.[2][3] In 2012, he was awarded the Pólya Prize, together with his former student Mathias Schacht, for this work on hypergraph regularity.[4]
Contents
Books
- Lua error in package.lua at line 80: module 'strict' not found.
See also
References
- ↑ V. Rödl: On a packing and covering problem, European J. Combin., 6 (1985), 69–78.
- ↑ V. Rödl, J. Skokan: Regularity lemma for uniform hypergraphs, Random Structures & Algorithms, 25 (2004), 1–42.
- ↑ B. Nagle, V. Rödl, M. Schacht: The Counting Lemma for regular k-uniform hypergraphs, Random Structures & Algorithms, 28 (2006), 113–179
- ↑ http://www.siam.org/prizes/sponsored/polya.php
