Concepedia

V. Rödl

VR

61

Publications

3.1K

Citations

32

H-Index

1977

Active since

Affiliations

Emory University(Current)

Czech Technical University in Prague

Universidade de São Paulo

Centre National de la Recherche Scientifique

Adam Mickiewicz University in Poznań

V. Rödl is an author at Emory University specializing in discrete mathematics, graph theory, and combinatorial optimization.

Top concepts

Discrete MathematicsGraph TheoryCombinatorial OptimizationEngineeringComputational ComplexityEducationComputer ScienceNetwork AnalysisNetwork ScienceMathematical Programming

Publications per year

1977–2009

61

Publications

61

The Algorithmic Aspects of the Regularity Lemma

Noga Alon, Richard A. Duke, Hanno Lefmann et al. · Journal of Algorithms · 1994 · 319 citations

Mathematical Programming, Engineering, Variational Analysis +4

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

Péter L. Erdős, Péter Frankl, V. Rödl · Graphs and Combinatorics · 1986 · 278 citations

Asymptotic Number, Graph Theory, Algebraic Graph Theory +6

The Ramsey number of a graph with bounded maximum degree

C Chvatál, V. Rödl, Endre Szemerédi et al. · Journal of Combinatorial Theory Series B · 1983 · 181 citations

Graph Theory, Structural Graph Theory, Topological Graph Theory +5

Near Perfect Coverings in Graphs and Hypergraphs

Péter Frankl, V. Rödl · European Journal of Combinatorics · 1985 · 176 citations

Perfect Coverings, Graph Theory, Topological Graph Theory +4

OnK 4-free subgraphs of random graphs

Yoshiharu Kohayakawa, Tomasz Łuczak, V. Rödl · COMBINATORICA · 1997 · 116 citations · Full text

Network Science, Graph Theory, Engineering +8

Rows per page

1–5 of 61