2012 - George Pólya Prize
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.
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.
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.
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.
On a Packing and Covering Problem
European Journal of Combinatorics (1985)
The counting lemma for regular k-uniform hypergraphs
Brendan Nagle;Vojtěch Rödl;Mathias Schacht.
Random Structures and Algorithms (2006)
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)
Regularity lemma for k-uniform hypergraphs
Vojtěch Rödl;Jozef Skokan.
Random Structures and Algorithms (2004)
Threshold functions for Ramsey properties
Vojtěch Rödl;Andrzej Ruciński.
Journal of the American Mathematical Society (1995)
A Dirac-Type Theorem for 3-Uniform Hypergraphs
Vojtěch Rödl;Andrzej Ruciński;Endre Szemerédi.
Combinatorics, Probability & Computing (2006)
Partitions of finite relational and set systems
Jaroslav Nešetřil;Vojtěch Rödl.
Journal of Combinatorial Theory, Series A (1977)
The Ramsey property for graphs with forbidden complete subgraphs
Jaroslav Nešetřil;Vojtěch Rödl.
Journal of Combinatorial Theory, Series B (1976)
Hypergraphs do not jump
Peter Frankl;Vojtěch Rödl.
Geometrical realization of set systems and probabilistic communication complexity
N. Alon;P. Frankl;V. Rodl.
foundations of computer science (1985)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: