Vojtěch Rödl

8.0k citations
224 papers · 3.9k indexed · h-index 34

Vojtěch Rödl

214 papers receiving 3.5k citations

Peers

Vojtěch Rödl
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
Replace Vera T. Sós with:
Vera T. Sós Hungary
Miklós Simonovits Hungary
V. Rödl United States
R. Rado United Kingdom
William M. Kantor United States
Alexander Razborov Russia
Van H. Vu United States
Andrew Thomason United States
J. W. P. Hirschfeld United Kingdom
Imre Z. Ruzsa Hungary
Vojtěch Rödl relative to Vera T. Sós Hungary Vera T. Sós's profile →
Citations per field
00.5×2.6×
Vera T. Sós · 1×
Citations per year

Countries citing papers authored by Vojtěch Rödl

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network

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.

Border = papers with Vojtěch Rödl Line = papers co-authored together Vojtěch Rödl links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20250
2 20231
3
Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
20191
4 20184
5 20183
6 20154
7 20135
8 20094
9
A note on perfect matchings in uniform hypergraphs with large minimum collective degree
200815
10 200647
11 200269
12
Perfect matchings in ε-regular graphs
19985
13
Note on Ramsey numbers and self-complementary graphs
19952
14
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
19925
15 198787
16
Partite construction and Ramseyan theorems for sets, numbers and spaces
19872
17 19867
18
On coverings of random graphs
19823
19
On Ramsey graphs without cycles of short odd lengths
19798
20
On generating of relations
19732

About Vojtěch Rödl

Vojtěch Rödl is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Theory and Mathematics, Algebra and Number Theory and Mathematical Physics, 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 Labeling and Dimension Problems (36 papers), graph theory and CDMA systems (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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026