Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Vera T. Sós'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 Vera T. Sós with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vera T. Sós more than expected).
This network shows the impact of papers produced by Vera T. Sós. 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 Vera T. Sós. The network helps show where Vera T. Sós may publish in the future.
Co-authorship network of co-authors of Vera T. Sós
This figure shows the co-authorship network connecting the top 25 collaborators of Vera T. Sós.
A scholar is included among the top collaborators of Vera T. Sós based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Vera T. Sós. Vera T. Sós is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Borgs, Christian, Jennifer Chayes, László Lovász, Vera T. Sós, & K. Vesztergombi. (2011). Limits of randomly grown graph sequences. European Journal of Combinatorics. 32(7). 985–999.30 indexed citations
3.
Borgs, Christian, Jennifer Chayes, L. Lovász, Vera T. Sós, & K. Vesztergombi. (2008). Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Advances in Mathematics. 219(6). 1801–1851.260 indexed citations breakdown →
Simonovits, Miklós & Vera T. Sós. (2001). Ramsey–Turán theory. Discrete Mathematics. 229(1-3). 293–340.32 indexed citations
9.
Erdős, Péter L., Andràs Sárközy, & Vera T. Sós. (1995). On sum sets of sidon sets, II. Israel Journal of Mathematics. 90(1-3). 221–233.3 indexed citations
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.