Most cited papers in Limits and Structures in Graph Theory
What are the most cited papers in Limits and Structures in Graph Theory?
The most cited paper in Limits and Structures in Graph Theory is "Spectral Graph Theory" (Fan Chung, 1996), with 5,771 citations. Next come "A critical point for random graphs with a given degree sequence" (2,427) and "On the Shannon capacity of a graph" (1,675).
Showing 50 of 100 papers. Every paper with more than 320 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Spectral Graph Theory Fan Chung · Regional conference series in mathematics | 3 Dec 1996 | 5,771 |
| 2 | A critical point for random graphs with a given degree sequence Michael S. O. Molloy, Bruce A. Reed · Random Structures and Algorithms | Mar 1995 | 2,427 |
| 3 | On the Shannon capacity of a graph László Lovász · IEEE Transactions on Information Theory | 1979 | 1,675 |
| 4 | The strong perfect graph theorem Maria Chudnovsky, Neil R. Robertson, Paul D. Seymour et al. · Annals of Mathematics | Jul 2006 | 1,300 |
| 5 | A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs Béla Bollobás · European Journal of Combinatorics | Dec 1980 | 1,208 |
| 6 | The Space Complexity of Approximating the Frequency Moments Noga Alon, Yossi Matias, Márió Szegedy · Journal of Computer and System Sciences | Feb 1999 | 1,185 |
| 7 | On the ratio of optimal integral and fractional covers László Lovász · Discrete Mathematics | 1975 | 1,134 |
| 8 | Connected Components in Random Graphs with Given Expected Degree Sequences Fan Chung, Linyuan Lü · Annals of Combinatorics | Nov 2002 | 976 |
| 9 | A random graph model for massive graphs William A. Aiello, Fan Chung, Linyuan Lü | May 2000 | 933 |
| 10 | The average distances in random graphs with given expected degrees Fan Chung, Linyuan Lü · Proceedings of the National Academy of Sciences | 4 Dec 2002 | 926 |
| 11 | Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions Harry Furstenberg · Journal d Analyse Mathématique | Dec 1977 | 886 |
| 12 | On the density of families of sets N. Sauer · Journal of Combinatorial Theory Series A | Jul 1972 | 870 |
| 13 | The Size of the Giant Component of a Random Graph with a Given Degree Sequence Michael S. O. Molloy, Bruce A. Reed · Combinatorics Probability Computing | Sep 1998 | 857 |
| 14 | Limits of dense graph sequences László Lovász, Balázs Szegedy · Journal of Combinatorial Theory Series B | 22 Jun 2006 | 854 |
| 15 | A fast and simple randomized parallel algorithm for the maximal independent set problem Noga Alon, László Babai, Alon Itai · Journal of Algorithms | Dec 1986 | 845 |
| 16 | The degree sequence of a scale‐free random graph process Béla Bollobás, Oliver M. Riordan, Joel Spencer et al. · Random Structures and Algorithms | 18 Apr 2001 | 840 |
| 17 | Min-Wise Independent Permutations Andrei Broder, Moses Charikar, ALAN M. FRIEZE et al. · Journal of Computer and System Sciences | Jun 2000 | 834 |
| 18 | The primes contain arbitrarily long arithmetic progressions Benjamin Green, Terence Tao · Annals of Mathematics | Mar 2008 | 832 |
| 19 | Graph Minors. XX. Wagner's conjecture Neil R. Robertson, Paul D. Seymour · Journal of Combinatorial Theory Series B | Nov 2004 | 824 |
| 20 | A characterization of the minimum cycle mean in a digraph Richard M. Karp · Discrete Mathematics | 1978 | 752 |
| 21 | Maxima for Graphs and a New Proof of a Theorem of Turán Theodore S. Motzkin, E. G. Straus · Canadian Journal of Mathematics | 1965 | 734 |
| 22 | A new proof of Szemerédi's theorem W. T. Gowers · Geometric and Functional Analysis | 15 Aug 2001 | 728 |
| 23 | On the normal concentration of divisors, 2 Helmut Maier, Gérald Tenenbaum · Mathematical Proceedings of the Cambridge Philosophical Society | 6 Jul 2009 | 697 |
| 24 | Sharp thresholds of graph properties, and the $k$-sat problem Ehud Friedgut, appendix by Jean Bourgain · Journal of the American Mathematical Society | 27 May 1999 | 697 |
| 25 | On extensions of the Brunn-Minkowski and Prékopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation Herm Jan Brascamp, Élliott H. Lieb · Journal of Functional Analysis | Aug 1976 | 688 |
| 26 | On the complexity of H-coloring Pavol Hell, Jaroslav Nešetřil · Journal of Combinatorial Theory Series B | Feb 1990 | 674 |
| 27 | Graph Theory and Probability P. Erdös · Birkhäuser Boston eBooks | 2009 | 647 |
| 28 | Combinatorial Nullstellensatz Noga Alon · Combinatorics Probability Computing | 1999 | 641 |
| 29 | A note on Hamiltonian circuits Vašek Chvátal, P. Erdös · Discrete Mathematics | May 1972 | 637 |
| 30 | Finding and counting given length cycles Noga Alon, Raphael Yuster, Uri Zwick · Algorithmica | Mar 1997 | 625 |
| 31 | Models of Random Regular Graphs N. C. Wormald · Cambridge University Press eBooks | Jul 1999 | 625 |
| 32 | Tough graphs and hamiltonian circuits Vašek Chvátal · Discrete Mathematics | Jul 1973 | 624 |
| 33 | Visual Cryptography for General Access Structures Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis et al. · Information and Computation | Sep 1996 | 619 |
| 34 | On certain polytopes associated with graphs Vašek Chvátal · Journal of Combinatorial Theory Series B | Apr 1975 | 619 |
| 35 | Graph Theory and Probability Paul L. Erdos · Canadian Journal of Mathematics | 1959 | 605 |
| 36 | Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing Christian Borgs, Jennifer Chayes, L. Lovász et al. · Advances in Mathematics | 9 Sep 2008 | 604 |
| 37 | Probabilistic Methods in Combinatorics Joel Spencer · Birkhäuser Basel eBooks | 1995 | 593 |
| 38 | The maximum numbers of faces of a convex polytope Peter McMullen · Mathematika | Dec 1970 | 589 |
| 39 | Simple Constructions of Almost k‐wise Independent Random Variables Noga Alon, Oded Goldreich, Johan Håstad et al. · Random Structures and Algorithms | 1992 | 566 |
| 40 | Intersection theorems with geometric consequences Péter Frankl, R. Wilson · COMBINATORICA | Dec 1981 | 533 |
| 41 | A guided tour of chernoff bounds Torben Hagerup, Christine Rüb · Information Processing Letters | Feb 1990 | 526 |
| 42 | Every Planar Graph Is 5-Choosable Carsten Thomassen · Journal of Combinatorial Theory Series B | Sep 1994 | 520 |
| 43 | Approximating clique-width and branch-width Sang‐il Oum, Paul D. Seymour · Journal of Combinatorial Theory Series B | 6 Jan 2006 | 504 |
| 44 | Greedy Approximation Algorithms for Finding Dense Components in a Graph Moses Charikar · Lecture notes in computer science | 2000 | 495 |
| 45 | Quasi-random graphs Fan Chung, Ronald Graham, R. Wilson · COMBINATORICA | Dec 1989 | 488 |
| 46 | Nonconventional ergodic averages and nilmanifolds Bernard Host, Bryna Kra · Annals of Mathematics | 2005 | 485 |
| 47 | Hamiltonian circuits in random graphs L. Pósa · Discrete Mathematics | 1976 | 469 |
| 48 | Optimal numberings and isoperimetric problems on graphs L. H. Harper · Journal of Combinatorial Theory | 1966 | 466 |
| 49 | Paired-domination in graphs Teresa W. Haynes, Peter J. Slater · Networks | Oct 1998 | 465 |
| 50 | On a combinatorial problem in geometry H. L. Abbott, D. Hanson · Discrete Mathematics | 1975 | 461 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.