Vera T. Sós

60 papers receiving 2.1k citations

Hit Papers

On a problem of K. Zarankiewicz195420261978200219542008100200300

Peers

Vera T. Sós
Comparison fields: 5 of 76
  • Computational Theory and Mathematics 1.4k
  • Discrete Mathematics and Combinatorics 1.3k
  • Geometry and Topology 954
  • Electrical and Electronic Engineering 310
  • Mathematical Physics 242
Replace Thomas Zasĺavsky with:
Thomas Zasĺavsky United States
Van H. Vu United States
Miklós Simonovits Hungary
Benny Sudakov United States
Zoltán Füredi Hungary
R. Wilson United States
Michael Krivelevich Israel
Gil Kalai Israel
Peter McMullen United Kingdom
Curtis Greene United States
Vera T. Sós relative to Thomas Zasĺavsky United States Thomas Zasĺavsky's profile →
Citations per field
00.5×1.5×
Thomas Zasĺavsky · 1×
Citations per year

Countries citing papers authored by Vera T. Sós

Since Specialization
Citations

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).

Fields of papers citing papers by Vera T. Sós

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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.

All Works

20 of 20 papers shown
#WorkIndexed citations
1 0
2 30
3
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testingbreakdown →
260
4 8
5 38
6 3
7 15
8 32
9 9
10 3
11 18
12 62
13 14
14 7
15
Algebraic methods in graph theory
144
16 8
17
Infinite and finite sets : to Paul Erdős on his 60th birthday
4
18 7
19
Combinatorial theory and its applications
179
20 3

About Vera T. Sós

Vera T. Sós is a scholar working on Discrete Mathematics and Combinatorics, Theoretical Computer Science and Geometry and Topology, having authored 62 papers that have together received 2.2k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (28 papers), Advanced Graph Theory Research (17 papers) and Advanced Topology and Set Theory (14 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.3k citations), Geometry and Topology (954 citations) and Computational Theory and Mathematics (1.4k citations). Vera T. Sós has collaborated with scholars based in Hungary, United States and Canada. Frequent co-authors include László Lovász, T. Kővári, P. Erdös, Christian Borgs, K. Vesztergombi, Jennifer Chayes, Miklós Simonovits, Paul Erdős, L. Lovász and Bolyai János Matematikai Társulat. Their work appears in journals such as Annals of Mathematics, Advances in Mathematics and IEEE Transactions on Reliability.

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