Subfield · Discrete Mathematics and Combinatorics
Most cited papers in Discrete Mathematics and Combinatorics
What are the most cited papers in Discrete Mathematics and Combinatorics?
The most cited paper in Discrete Mathematics and Combinatorics is "Spectral Graph Theory" (Fan Chung, 1996), with 5,771 citations. Next come "Communication and concurrency" (3,977) and "Partial differential equations of parabolic type" (3,305).
Showing 50 of 100 papers. Every paper with more than 593 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Spectral Graph Theory Fan Chung · Regional conference series in mathematics | 3 Dec 1996 | 5,771 |
| 2 | Communication and concurrency Wojciech Penczek · Science of Computer Programming | May 1990 | 3,977 |
| 3 | Partial differential equations of parabolic type John S. Maybee · Journal of the Franklin Institute | Jun 1965 | 3,305 |
| 4 | 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 |
| 5 | The Gaia Methodology for Agent-Oriented Analysis and Design Michael Wooldridge, Nicholas R. Jennings, David Kinny · Autonomous Agents and Multi-Agent Systems | Sep 2000 | 1,893 |
| 6 | On the resemblance and containment of documents Arndt Bröder | 22 Nov 2002 | 1,741 |
| 7 | Representations of Coxeter groups and Hecke algebras David Kazhdan, G. Lusztig · Inventiones mathematicae | Jun 1979 | 1,739 |
| 8 | Compact matrix pseudogroups Stanisław Lech Woronowicz · Communications in Mathematical Physics | Dec 1987 | 1,700 |
| 9 | On the Shannon capacity of a graph László Lovász · IEEE Transactions on Information Theory | 1979 | 1,675 |
| 10 | State models and the jones polynomial Louis Hirsch Kauffman · Topology | 1987 | 1,478 |
| 11 | SIMPLE GROUPS OF LIE TYPE Ian G. MacDonald · Bulletin of the London Mathematical Society | Mar 1975 | 1,471 |
| 12 | RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS RALPH ALLAN BRADLEY, Milton E. Terry · Biometrika | 1952 | 1,404 |
| 13 | The strong perfect graph theorem Maria Chudnovsky, Neil R. Robertson, Paul D. Seymour et al. · Annals of Mathematics | Jul 2006 | 1,300 |
| 14 | On the distribution of the length of the longest increasing subsequence of random permutations Jinho Baik, Percy A. Deift, Kurt Johansson · Journal of the American Mathematical Society | 24 Jun 1999 | 1,257 |
| 15 | 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 |
| 16 | State sum invariants of 3-manifolds and quantum 6j-symbols Vladimir Georgievich Turaev, Oleg Ya. Viro · Topology | Oct 1992 | 1,195 |
| 17 | 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 |
| 18 | Three Partition Refinement Algorithms Robert A. Paige, Robert Endre Tarjan · SIAM Journal on Computing | Dec 1987 | 1,172 |
| 19 | A Single Formula for the “Law of the Wall” D. BRIAN SPALDING · Journal of Applied Mechanics | Sep 1961 | 1,169 |
| 20 | HARMONIC POLYLOGARITHMS Ettore Remiddi, J. A. M. Vermaseren · International Journal of Modern Physics A | 20 Feb 2000 | 1,159 |
| 21 | On the ratio of optimal integral and fractional covers László Lovász · Discrete Mathematics | 1975 | 1,134 |
| 22 | Probabilistic algorithms for sparse polynomials Richard E. Zippel · Lecture notes in computer science | 1979 | 1,134 |
| 23 | Statistical Ensembles of Complex, Quaternion, and Real Matrices J. Ginibre · Journal of Mathematical Physics | Mar 1965 | 1,115 |
| 24 | Ribbon graphs and their invaraints derived from quantum groups Nicolai Reshetikhin, Vladimir Georgievich Turaev · Communications in Mathematical Physics | 1990 | 1,093 |
| 25 | Groupes réductifs sur un corps local : I. Données radicielles valuées François Bruhat, Jacques Tits · Publications mathématiques de l IHÉS | 7 Dec 1972 | 1,043 |
| 26 | Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices Jinho Baik, Gérard Ben Arous, Sandrine Péché · The Annals of Probability | Sep 2005 | 1,030 |
| 27 | Ramanujan graphs Alexander Lubotzky, Ralph S. Phillips, Peter Sarnak · COMBINATORICA | Sep 1988 | 1,015 |
| 28 | Random generation of combinatorial structures from a uniform distribution Mark Jerrum, Leslie Gabriel Valiant, Vijay V. Vazirani · Theoretical Computer Science | 1986 | 1,013 |
| 29 | Combinatorial Enumeration Robin Pemantle, Mark Curtis Wilson, Stephen Melczer · Cambridge University Press eBooks | 8 Feb 2024 | 977 |
| 30 | Connected Components in Random Graphs with Given Expected Degree Sequences Fan Chung, Linyuan Lü · Annals of Combinatorics | Nov 2002 | 976 |
| 31 | The Umbral Calculus Steven Roman, Gian-Carlo Rota · Graduate texts in mathematics | Feb 1978 | 969 |
| 32 | A random graph model for massive graphs William A. Aiello, Fan Chung, Linyuan Lü | May 2000 | 933 |
| 33 | 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 |
| 34 | Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions Harry Furstenberg · Journal d Analyse Mathématique | Dec 1977 | 886 |
| 35 | Eight-vertex SOS model and generalized Rogers-Ramanujan-type identities George E. Andrews, R. J. Baxter, Peter J. Forrester · Journal of Statistical Physics | May 1984 | 885 |
| 36 | Free subgroups in linear groups Jacques Tits · Journal of Algebra | Feb 1972 | 883 |
| 37 | Software processes are software too Leon J. Osterweil | Mar 1987 | 871 |
| 38 | On the density of families of sets N. Sauer · Journal of Combinatorial Theory Series A | Jul 1972 | 870 |
| 39 | Singularity Analysis of Generating Functions Philippe Flajolet, Andrew M. Odlyzko · SIAM Journal on Discrete Mathematics | May 1990 | 860 |
| 40 | 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 |
| 41 | Limits of dense graph sequences László Lovász, Balázs Szegedy · Journal of Combinatorial Theory Series B | 22 Jun 2006 | 854 |
| 42 | 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 |
| 43 | 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 |
| 44 | Min-Wise Independent Permutations Andrei Broder, Moses Charikar, ALAN M. FRIEZE et al. · Journal of Computer and System Sciences | Jun 2000 | 834 |
| 45 | The primes contain arbitrarily long arithmetic progressions Benjamin Green, Terence Tao · Annals of Mathematics | Mar 2008 | 832 |
| 46 | Graph Minors. XX. Wagner's conjecture Neil R. Robertson, Paul D. Seymour · Journal of Combinatorial Theory Series B | Nov 2004 | 824 |
| 47 | A COORDINATE SYSTEM HAVING SOME SPECIAL ADVANTAGES FOR NUMERICAL FORECASTING Norman A. Phillips · Journal of Meteorology | Apr 1957 | 811 |
| 48 | Binomial determinants, paths, and hook length formulae Ira M. Gessel, Gérard Viennot · Advances in Mathematics | Dec 1985 | 794 |
| 49 | Probabilistic Load Flow Barbara Borkowska · IEEE Transactions on Power Apparatus and Systems | May 1974 | 794 |
| 50 | Modelling using Polynomial Regression Eva Ostertagová · Procedia Engineering | 2012 | 794 |
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.