K. Vesztergombi

1.6k total citations · 1 hit paper
12 papers, 639 citations indexed

About

K. Vesztergombi is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, K. Vesztergombi has authored 12 papers receiving a total of 639 indexed citations (citations by other indexed papers that have themselves been cited), including 6 papers in Computational Theory and Mathematics, 5 papers in Discrete Mathematics and Combinatorics and 5 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in K. Vesztergombi's work include Computational Geometry and Mesh Generation (5 papers), Limits and Structures in Graph Theory (5 papers) and Advanced Graph Theory Research (4 papers). K. Vesztergombi is often cited by papers focused on Computational Geometry and Mesh Generation (5 papers), Limits and Structures in Graph Theory (5 papers) and Advanced Graph Theory Research (4 papers). K. Vesztergombi collaborates with scholars based in Hungary, United States and Switzerland. K. Vesztergombi's co-authors include Christian Borgs, Vera T. Sós, Jennifer Chayes, László Lovász, L. Lovász, J. Spencer, Balázs Szegedy, Emo Welzl, Uli Wagner and Arthur T. Benjamin and has published in prestigious journals such as Annals of Mathematics, American Mathematical Monthly and Advances in Mathematics.

In The Last Decade

K. Vesztergombi

12 papers receiving 604 citations

Hit Papers

Convergent sequences of dense graphs I: Subgraph frequenc... 2008 2026 2014 2020 2008 50 100 150 200 250
What are hit papers?

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.

  1. Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
    2008 260 citations Christian Borgs, Jennifer Chayes et al. Advances in Mathematics profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
K. Vesztergombi Hungary 9 296 262 234 113 109 12 639
David P. Robbins United States 14 188 0.6× 476 1.8× 369 1.6× 77 0.7× 141 1.3× 37 788
J. Spencer United States 16 474 1.6× 348 1.3× 225 1.0× 40 0.4× 135 1.2× 41 928
Catherine H. Yan United States 13 166 0.6× 272 1.0× 206 0.9× 89 0.8× 159 1.5× 56 612
Roy Meshulam Israel 18 575 1.9× 380 1.5× 285 1.2× 31 0.3× 198 1.8× 59 878
L. Bruce Richmond Canada 15 185 0.6× 305 1.2× 164 0.7× 32 0.3× 247 2.3× 55 602
L. H. Harper United States 12 482 1.6× 280 1.1× 197 0.8× 28 0.2× 140 1.3× 36 1.0k
Michał Karoński Poland 14 745 2.5× 265 1.0× 242 1.0× 167 1.5× 216 2.0× 30 1.1k
Robert A. Sulanke United States 15 122 0.4× 332 1.3× 167 0.7× 50 0.4× 133 1.2× 30 775
J. Kahn United States 7 312 1.1× 138 0.5× 101 0.4× 29 0.3× 79 0.7× 17 589
Michael Drmota Austria 16 256 0.9× 179 0.7× 133 0.6× 116 1.0× 522 4.8× 72 920

Countries citing papers authored by K. Vesztergombi

Since Specialization
Citations

This map shows the geographic impact of K. Vesztergombi'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 K. Vesztergombi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites K. Vesztergombi more than expected).

Fields of papers citing papers by K. Vesztergombi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by K. Vesztergombi. 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 K. Vesztergombi. The network helps show where K. Vesztergombi may publish in the future.

Co-authorship network of co-authors of K. Vesztergombi

This figure shows the co-authorship network connecting the top 25 collaborators of K. Vesztergombi. A scholar is included among the top collaborators of K. Vesztergombi 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 K. Vesztergombi. K. Vesztergombi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

12 of 12 papers shown
1.
Borgs, Christian, Jennifer Chayes, László Lovász, Vera T. Sós, & K. Vesztergombi. (2012). Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Annals of Mathematics. 176(1). 151–219. 129 indexed citations
2.
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 →
4.
Borgs, Christian, Jennifer Chayes, László Lovász, et al.. (2006). Graph limits and parameter testing. 261–270. 89 indexed citations
5.
Benjamin, Arthur T., et al.. (2004). Discrete Mathematics: Elementary and Beyond. American Mathematical Monthly. 111(7). 636–636. 7 indexed citations
6.
Vesztergombi, K., Uli Wagner, & Emo Welzl. (2003). Convex Quadrilaterals and k-Sets. 11. 32 indexed citations
7.
Vesztergombi, K.. (1996). The two largest distances in finite planar sets. Discrete Mathematics. 150(1-3). 379–386. 2 indexed citations
8.
Lovász, László, et al.. (1989). On the graph of large distances. Discrete & Computational Geometry. 4(6). 541–549. 6 indexed citations
9.
Vesztergombi, K.. (1987). On large distances in planar sets. Discrete Mathematics. 67(2). 191–198. 10 indexed citations
10.
Lovász, László, J. Spencer, & K. Vesztergombi. (1986). Discrepancy of Set-systems and Matrices. European Journal of Combinatorics. 7(2). 151–160. 50 indexed citations
11.
Vesztergombi, K.. (1985). On the distribution of distances in finite sets in the plane. Discrete Mathematics. 57(1-2). 129–145. 9 indexed citations
12.
Vesztergombi, K.. (1979). Some remarks on the chromatic number of the strong product of graphs.. Acta Cybernetica. 4. 207–212. 15 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by David P. Robbins Breakdown of academic impact, for papers by J. Spencer Breakdown of academic impact, for papers by Catherine H. Yan Breakdown of academic impact, for papers by Roy Meshulam Breakdown of academic impact, for papers by L. Bruce Richmond Breakdown of academic impact, for papers by L. H. Harper Breakdown of academic impact, for papers by Michał Karoński Breakdown of academic impact, for papers by Robert A. Sulanke Breakdown of academic impact, for papers by J. Kahn Breakdown of academic impact, for papers by Michael Drmota
Rankless by CCL
2026