Vojtěch Rödl 
			Department of Mathematics and Computer Science, Emory University 
		 
		Ph.D. students
		
			- Edita Šiňajová
 
			Representations of graphs in Euclidean spaces 
			Czech Technical University (1990)
			 - Nancy Eaton
 
			Some results in graph Ramsey theory and graph representations 
			Emory University (1992)
			 - Mark Ginn
 
			On the computational complexity of ordered subgraph recognition 
			Emory University (1994), jointly with D. Duffus
			 - Beata Wysocka
 
			Some results in Ramsey theory 
			Emory University (1995)
			 - David Gunderson
 
			Extremal problems on Boolean algebras, sum-sets of integers and hypergraphs 
			Emory University (1995)
			 - Luboš Thoma
 
			Essays in extremal combinatorics 
			Emory University (1996)
			 - Andrzej Czygrinow
 
			Constructive version of the regularity lemma and its applications 
			Emory University (1998)
			 - Michelle Wagner
 
			Derandomization of the blow-up lemma 
			Emory University (1999), jointly with D. Duffus
			 - Brendan Nagle
 
			Regularity properties for triple systems 
			Emory University (1999)
			 - Jozef Skokan
 
			Uniformity of set systems 
			Emory University (2000)
			 - Yuejian Peng
 
			Counting Small Cliques in a 3-Uniform Hypergraph 
			Emory University (2001), jointly with A.Ruciński
			 - Yulia Dementieva
 
			Equivalent Conditions for Hypergraph Regularity 
			Emory University (2001)
			 - Papa Sissokho
 
			Light Spanners and Sparse Pseudo-random Graphs 
			Emory University (2003), jointly with M. Grigni
			 - Mathias Schacht
 
			On the regularity method for hypergraphs 
			Emory University (2004)
			 - Mark Siggers
 
			Hypergraph Packings and Galois Cohomology 
			Emory University (2005), jointly with E. Brussel
			 - Eduardo Tengan
 
			Cohomology on Surfaces; A Ramsey problem 
			Emory University (2006), jointly with E. Brussel
			 - Jan Zich
 
			Triangulations and Hajos Conjecture 
			Emory University (2007)
			 - Esmeralda Nastase
 
			Color Criticality and Chromatic Connectivity of Graphs 
			Emory University (2007)
			 - Andrzej Dudek
 
			Problems in
			Extremal Combinatorics 
			Emory University (2008)
			 - Annika Poerschke
 
			On Algorithmic Regularity 
			Emory University (2008)
			 - Christian Avart
 
			Colorful Flowers 
			Emory University (2008)
			 - Benjamin Shemmer
 
			On Graphs with
			Given Endomorphism Monoids 
			Emory University (2009)
			 - Daniel Martin
 
			Locally Nearly
			Perfect Packings 
			Emory University (2009)
			 - Domingos Dellamonica Jr.
 
			Topics in Ramsey Theory
			 
			Emory University (2012)
			 - Sangjune Lee
 
			On Sidon-sets of integers and the
			Cameron-Erdős conjecture
			 
			Emory University (2012)
			 - Steven La Fleur
 
 			On problems in extremal graph theory and
				Ramsey theory
			 
			Emory University (2013)
			 - Vindya Bhat
 
 			Ramsey Theorem and Ramsey Turan type 
			results for hypergraphs
			 
			Emory University (2015)
			 - Troy John Retter
 
 			Some Ramsey Type Theorems
			 
			Emory University (2016)
			 - Bill Kay
 
 			Extremal problems for graphs and hypergraphs
			 
			Emory University (2017), jointly with Dwight Duffus
			 - Brad Elliott
 
             
        
                        Emory University (2018)
			 - Marcelo Sales
 
                        Emory University (2023)
			 - Ayush Basu
 
                        Emory University (Current)
		  
		
	 |