H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Mathematics D-index 45 Citations 7,164 225 World Ranking 786 National Ranking 380
Engineering and Technology D-index 44 Citations 6,818 212 World Ranking 2101 National Ranking 859

Research.com Recognitions

Awards & Achievements

2012 - George Pólya Prize

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Discrete mathematics
  • Algebra

Vojtěch Rödl mainly investigates Discrete mathematics, Combinatorics, Hypergraph, Ramsey's theorem and Lemma. By researching both Discrete mathematics and Randomness, Vojtěch Rödl produces research that crosses academic boundaries. His Combinatorics and Partition, Existential quantification, Complement graph, Path graph and Degree investigations all form part of his Combinatorics research activities.

His Hypergraph study integrates concerns from other disciplines, such as Jump, Negative - answer, Type, Hamiltonian path and Dirac. In his research on the topic of Ramsey's theorem, Finitary, Conjecture, Ergodic theory and Euclidean geometry is strongly related with Ramsey theory. In his study, Combinatorial proof is inextricably linked to Extremal graph theory, which falls within the broad field of Lemma.

His most cited work include:

  • On a Packing and Covering Problem (360 citations)
  • The counting lemma for regular k-uniform hypergraphs (253 citations)
  • Regularity lemma for k-uniform hypergraphs (239 citations)

What are the main themes of his work throughout his whole career to date?

Vojtěch Rödl focuses on Combinatorics, Discrete mathematics, Hypergraph, Graph and Ramsey's theorem. The concepts of his Combinatorics study are interwoven with issues in Upper and lower bounds and Bounded function. His research integrates issues of Chromatic scale and Type in his study of Discrete mathematics.

His work deals with themes such as Vertex, Edge, Hamiltonian path and Degree, which intersect with Hypergraph. His Graph study frequently links to other fields, such as Graph theory.

He most often published in these fields:

  • Combinatorics (92.83%)
  • Discrete mathematics (70.19%)
  • Hypergraph (21.89%)

What were the highlights of his more recent work (between 2011-2021)?

  • Combinatorics (92.83%)
  • Discrete mathematics (70.19%)
  • Hypergraph (21.89%)

In recent papers he was focusing on the following fields of study:

Vojtěch Rödl spends much of his time researching Combinatorics, Discrete mathematics, Hypergraph, Upper and lower bounds and Graph. His Combinatorics research is multidisciplinary, incorporating elements of Class and Bounded function. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Function and Type.

His Hypergraph study combines topics in areas such as Extremal combinatorics, Hamiltonian path, Graph theory, Vertex and Interval. His Upper and lower bounds research integrates issues from Partition, Edge and Random graph. His studies deal with areas such as Exponential type and Mathematical proof as well as Partition.

Between 2011 and 2021, his most popular works were:

  • The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers (44 citations)
  • Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs (24 citations)
  • Packing minor-closed families of graphs into complete graphs (24 citations)

In his most recent research, the most cited papers focused on:

  • Combinatorics
  • Algebra
  • Discrete mathematics

His primary scientific interests are in Combinatorics, Discrete mathematics, Hypergraph, Graph and Ramsey's theorem. He interconnects Upper and lower bounds, Bounded function and Probabilistic method in the investigation of issues within Combinatorics. His work on Deterministic algorithm as part of general Discrete mathematics study is frequently linked to Random variable, therefore connecting diverse disciplines of science.

His research brings together the fields of Type and Hypergraph. The study incorporates disciplines such as Binary logarithm and Partition in addition to Graph. His Ramsey's theorem research incorporates elements of Function, Property and Order.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

On a Packing and Covering Problem

Vojtěch Rödl.
European Journal of Combinatorics (1985)

564 Citations

The counting lemma for regular k-uniform hypergraphs

Brendan Nagle;Vojtěch Rödl;Mathias Schacht.
Random Structures and Algorithms (2006)

379 Citations

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

P. Erdös;P. Frankl;V. Rödl.
Graphs and Combinatorics (1986)

303 Citations

Regularity lemma for k-uniform hypergraphs

Vojtěch Rödl;Jozef Skokan.
Random Structures and Algorithms (2004)

292 Citations

Threshold functions for Ramsey properties

Vojtěch Rödl;Andrzej Ruciński.
Journal of the American Mathematical Society (1995)

238 Citations

A Dirac-Type Theorem for 3-Uniform Hypergraphs

Vojtěch Rödl;Andrzej Ruciński;Endre Szemerédi.
Combinatorics, Probability & Computing (2006)

219 Citations

Partitions of finite relational and set systems

Jaroslav Nešetřil;Vojtěch Rödl.
Journal of Combinatorial Theory, Series A (1977)

213 Citations

The Ramsey property for graphs with forbidden complete subgraphs

Jaroslav Nešetřil;Vojtěch Rödl.
Journal of Combinatorial Theory, Series B (1976)

172 Citations

Hypergraphs do not jump

Peter Frankl;Vojtěch Rödl.
Combinatorica (1984)

143 Citations

Geometrical realization of set systems and probabilistic communication complexity

N. Alon;P. Frankl;V. Rodl.
foundations of computer science (1985)

130 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Vojtěch Rödl

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 89

Noga Alon

Noga Alon

Tel Aviv University

Publications: 77

Jacob Fox

Jacob Fox

Stanford University

Publications: 69

Yoshiharu Kohayakawa

Yoshiharu Kohayakawa

Universidade de São Paulo

Publications: 67

József Balogh

József Balogh

University of Illinois at Urbana-Champaign

Publications: 64

Jaroslav Nešetřil

Jaroslav Nešetřil

Charles University

Publications: 60

Terence Tao

Terence Tao

University of California, Los Angeles

Publications: 41

Zoltán Füredi

Zoltán Füredi

University of Illinois at Urbana-Champaign

Publications: 40

Béla Bollobás

Béla Bollobás

University of Memphis

Publications: 40

Daniela Kühn

Daniela Kühn

University of Birmingham

Publications: 38

Deryk Osthus

Deryk Osthus

University of Birmingham

Publications: 38

Michael Krivelevich

Michael Krivelevich

Tel Aviv University

Publications: 34

Angelika Steger

Angelika Steger

ETH Zurich

Publications: 33

Andrzej Ruciński

Andrzej Ruciński

Adam Mickiewicz University in Poznań

Publications: 29

Raphael Yuster

Raphael Yuster

University of Haifa

Publications: 27

Alexandr V. Kostochka

Alexandr V. Kostochka

University of Illinois at Urbana-Champaign

Publications: 25

Something went wrong. Please try again later.