Vojtěch Rödl
Encyclopedia
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 and his development, together with Nagle, Schacht and Skokan (and independently of Gowers), of the hypergraph
regularity lemma. He has Erdős number one.
Emory University
Emory University is a private research university in metropolitan Atlanta, located in the Druid Hills section of unincorporated DeKalb County, Georgia, United States. The university was founded as Emory College in 1836 in Oxford, Georgia by a small group of Methodists and was named in honor of...
, Atlanta, known for his work in combinatorics
Combinatorics
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size , deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria ,...
. He received his PhD from Charles University, Prague in 1976. Significant contributions include his work with Jaroslav Nešetřil
Jaroslav Nešetril
Jaroslav Nešetřil is a Czech mathematician, working at Charles University in Prague. His research areas include combinatorics , graph theory , algebra , posets , computer science .Nešetřil...
on Ramsey theory
Ramsey theory
Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of mathematics that studies the conditions under which order must appear...
, his proof of the Erdős-Hanani conjecture
Packing in a hypergraph
In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges in each subset share any vertex. There are two famous algorithms to achieve asymptotically optimal packing in k-uniform hypergraphs. One of them...
on hypergraph packing and his development, together with Nagle, Schacht and Skokan (and independently of Gowers), of the hypergraph
Hypergraph
In mathematics, a hypergraph is a generalization of a graph, where an edge can connect any number of vertices. Formally, a hypergraph H is a pair H = where X is a set of elements, called nodes or vertices, and E is a set of non-empty subsets of X called hyperedges or links...
regularity lemma. He has Erdős number one.