Leaderboards/Limits and Structures in Graph Theory

Limits and Structures in Graph Theory

Last updated July 7, 2026

Rising Stars

New and hot

Rising Stars Researchers

1
P. Erdős
Unknown
2
P. Erdős
Unknown
3
Yuansi Chen
ETH Zurich
4
Debsoumya Chakraborti
University College London
5
Dheer Noal Desai
University of Delaware
6
Matan Harel
Northeastern University
7
Peter Bradshaw
University of Illinois Urbana-Champaign
8
Pierre Aboulker
Centre National de la Recherche Scientifique
9
Irene Gil Fernández
University of Warwick
10
Dong Yeap Kang
Korea Advanced Institute of Science and Technology

Rising Stars Papers

1
Exact results on generalized Erdős-Gallai problems
European Journal of Combinatorics|2024
6 cit.
2
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs
COMBINATORICA|2024
4 cit.
3
Hamilton Transversals in Tournaments
COMBINATORICA|2024
4 cit.
4
Edge-disjoint cycles with the same vertex set
Advances in Mathematics|2025
3 cit.
5
Almost spanning distance trees in subsets of finite vector spaces
Bulletin of the London Mathematical Society|2024
2 cit.
6
Rainbow spanning trees in random subgraphs of dense regular graphs
Discrete Mathematics|2024
2 cit.
7
New Lower Bound on Ball Packing Density in High-Dimensional Hyperbolic Spaces
International Mathematics Research Notices|2025
2 cit.
8
New lower bounds on kissing numbers and spherical codes in high dimensions
American Journal of Mathematics|2025
1 cit.
9
Rainbow Saturation for Complete Graphs
SIAM Journal on Discrete Mathematics|2024
1 cit.
10
New Developments on Graph Sum Index
Graphs and Combinatorics|2026
1 cit.

Emerging Leaders

Gaining momentum

Emerging Leaders Researchers

1
A. Rényi
Unknown
2
Abhishek Methuku
University of Illinois Urbana-Champaign
3
W. T. Gowers
Collège de France
4
Pawaton Kaemawichanurat
King Mongkut's University of Technology Thonburi
5
Wenfei Xi
Yunnan Normal University
6
Ruth Luo
University of South Carolina
7
István Tomon
Statistics Sweden
8
Yilun Shang
Northumbria University
9
Jonas Hägglund
Umeå University
10
Wenbo Sun
Virginia Tech

Emerging Leaders Papers

1
On random graphs. I.
Publicationes Mathematicae Debrecen|2022
5.2k cit.
2
Notes on the Localization of Generalized Hexagonal Cellular Networks
Mathematics|2023
72 cit.
3
A system model of three-body interactions in complex networks: consensus and conservation
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences|2022
48 cit.
4
Non-linear consensus dynamics on temporal hypergraphs with random noisy higher-order interactions
Journal of Complex Networks|2023
36 cit.
5
Expected value of first Zagreb connection index in random cyclooctatetraene chain, random polyphenyls chain, and random chain network
Frontiers in Chemistry|2023
34 cit.
6
Single-valued neutrosophic fuzzy Sombor numbers and their applications in trade flows between different countries via sea route
The Journal of Supercomputing|2024
25 cit.
7
Fault-Tolerant Metric Dimension of Circulant Graphs
Mathematics|2022
24 cit.
8
Resilient tracking consensus over dynamic random graphs: A linear system approach
European Journal of Applied Mathematics|2022
24 cit.
9
Extensions of the Art Gallery Theorem
Annals of Combinatorics|2022
24 cit.
10
Resilient Vector Consensus Over Random Dynamic Networks Under Mobile Malicious Attacks
The Computer Journal|2023
24 cit.

Current Senior Leaders

Established & currently active

Current Senior Leaders Researchers

1
Bruce Reed
Academia Sinica
2
Benny Sudakov
ETH Zurich
3
Terence Tao
University of California, Los Angeles
4
Linyuan Lü
Jilin Electric Power Research Institute (China)
5
Paul Seymour
The Ohio State University
6
Vojtěch Rödl
Emory University
7
Nicholas Wormald
Monash University
8
Deryk Osthus
University of Birmingham
9
Andrzej Ruciński
Center for Discrete Mathematics and Theoretical Computer Science
10
Miklós Simonovits
Alfréd Rényi Institute of Mathematics

Current Senior Leaders Papers

1
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
IEEE Transactions on Information Theory|2006
15.8k cit.
2
Decoding by Linear Programming
IEEE Transactions on Information Theory|2005
7.3k cit.
3
Stable signal recovery from incomplete and inaccurate measurements
Communications on Pure and Applied Mathematics|2006
7.2k cit.
4
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory|2006
6.9k cit.
5
A critical point for random graphs with a given degree sequence
Random Structures and Algorithms|1995
2.4k cit.
6
The Power of Convex Relaxation: Near-Optimal Matrix Completion
IEEE Transactions on Information Theory|2010
2.1k cit.
7
Endpoint Strichartz estimates
American Journal of Mathematics|1998
2.1k cit.
8
Graph minors. II. Algorithmic aspects of tree-width
Journal of Algorithms|1986
1.5k cit.
9
Graph Minors .XIII. The Disjoint Paths Problem
Journal of Combinatorial Theory Series B|1995
1.3k cit.
10
Connected Components in Random Graphs with Given Expected Degree Sequences
Annals of Combinatorics|2002
963 cit.

Indexing Limits and Structures in Graph Theory Reagents

Citation data for reagents in this field is currently compiling.