131
Publications
6.8K
Citations
44
H-Index
1976
Active since
Vojtěch Rödl is an author at Emory University specializing in discrete mathematics, graph theory, and combinatorial optimization.
Top concepts
Discrete MathematicsGraph TheoryCombinatorial OptimizationEngineeringComputational ComplexityProbabilityEducationNetwork AnalysisNetwork ScienceComputer Science
Publications per year
1976–2019
131
131
Regularity Lemma for k‐uniform hypergraphs
Vojtěch Rödl, Jozef Skokan · Random Structures and Algorithms · 2004 · 260 citations
The counting lemma for regular k-uniform hypergraphs
Brendan Nagle, Vojtěch Rödl, Mathias Schacht · 2004 · 227 citations
Rows per page
1–5 of 131