Vojtěch Rödl
Impact in
- Discrete Mathematics and Combinatorics top 0.02%
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 0.1%
- Advanced Topology and Set Theory
- Graph theory and applications
Papers in
-
- Limits and Structures in Graph Theory 186
- Finite Group Theory Research 15
-
- Advanced Graph Theory Research 142
- Graph Labeling and Dimension Problems 36
- Complexity and Algorithms in Graphs 14
- Co-authors
- Andrzej Ruciński (30 shared papers)Jaroslav Nešetřil (33 shared papers)Péter Frankl (18 shared papers)Mathias Schacht (27 shared papers)Endre Szemerédi (13 shared papers)Brendan Nagle (10 shared papers)Jozef Skokan (5 shared papers)Yoshiharu Kohayakawa (21 shared papers)
- Journals
- Journal of Combinatorial Theory Series A (27 papers)Random Structures and Algorithms (24 papers)Discrete Mathematics (19 papers)COMBINATORICA (18 papers)Journal of Combinatorial Theory Series B (17 papers)
- Partner nations
- United StatesCzechiaGermany
In The Last Decade
Vojtěch Rödl
214 papers receiving 3.5k citations
Peers
Comparison fields: 5 of 65
- Discrete Mathematics and Combinatorics 3.3k
- Geometry and Topology 2.2k
- Computational Theory and Mathematics 3.0k
- Algebra and Number Theory 129
- Mathematical Physics 159
Countries citing papers authored by Vojtěch Rödl
This map shows the geographic impact of Vojtěch Rödl's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Vojtěch Rödl with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vojtěch Rödl more than expected).
Fields of papers citing papers by Vojtěch Rödl
This network shows the impact of papers produced by Vojtěch Rödl. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Vojtěch Rödl. The network helps show where Vojtěch Rödl may publish in the future.
Co-authors
The 25 scholars most cited alongside Vojtěch Rödl, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 224 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1985 | 222 | |
| 2 | 2004 | 130 | |
| 3 | 2006 | 112 | |
| 4 | The counting lemma for regular k-uniform hypergraphs | 2004 | 108 |
| 5 | 2008 | 89 | |
| 6 | 1987 | 87 | |
| 7 | 1984 | 83 | |
| 8 | 1977 | 82 | |
| 9 | 2006 | 82 | |
| 10 | 1995 | 80 | |
| 11 | 2008 | 79 | |
| 12 | 2002 | 78 | |
| 13 | 1986 | 73 | |
| 14 | 2002 | 69 | |
| 15 | 1976 | 64 | |
| 16 | 2012 | 62 | |
| 17 | 1995 | 60 | |
| 18 | 1990 | 51 | |
| 19 | 1986 | 51 | |
| 20 | 2002 | 50 |
About Vojtěch Rödl
Vojtěch Rödl is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering and Algebra and Number Theory, having authored 224 papers that have together received 3.9k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (186 papers), Advanced Graph Theory Research (142 papers), Advanced Topology and Set Theory (86 papers), graph theory and CDMA systems (36 papers), Graph Labeling and Dimension Problems (36 papers), Graph theory and applications (36 papers), Finite Group Theory Research (15 papers) and Complexity and Algorithms in Graphs (14 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (3.3k citations), Geometry and Topology (2.2k citations), Computational Theory and Mathematics (3.0k citations), Algebra and Number Theory (129 citations) and Mathematical Physics (159 citations). Vojtěch Rödl has collaborated with scholars based in United States, Czechia and Germany. Frequent co-authors include Andrzej Ruciński, Jaroslav Nešetřil, Péter Frankl, Mathias Schacht, Endre Szemerédi, Brendan Nagle, Jozef Skokan, Yoshiharu Kohayakawa, Hanno Lefmann and Dhruv Mubayi. Their work appears in journals such as Journal of Combinatorial Theory Series A, Random Structures and Algorithms, Discrete Mathematics, COMBINATORICA and Journal of Combinatorial Theory Series B.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.