Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
- Cited by 545
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
-
- Published online by Cambridge University Press:
- 01 September 1998, pp. 295-305
-
- Article
- Export citation
- Cited by 400
Combinatorial Nullstellensatz
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 7-29
-
- Article
- Export citation
- Cited by 244
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 351-370
-
- Article
- Export citation
- Cited by 162
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
-
- Published online by Cambridge University Press:
- 01 September 1997, pp. 353-358
-
- Article
- Export citation
- Cited by 155
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions†
-
- Published online by Cambridge University Press:
- 09 January 2013, pp. 294-318
-
- Article
- Export citation
- Cited by 147
Generating Random Regular Graphs Quickly
-
- Published online by Cambridge University Press:
- 01 July 1999, pp. 377-396
-
- Article
- Export citation
- Cited by 144
A Dirac-Type Theorem for 3-Uniform Hypergraphs
-
- Published online by Cambridge University Press:
- 03 January 2006, pp. 229-251
-
- Article
- Export citation
- Cited by 134
Boltzmann Samplers for the Random Generation of Combinatorial Structures
-
- Published online by Cambridge University Press:
- 24 September 2004, pp. 577-625
-
- Article
- Export citation
- Cited by 130
On Random Intersection Graphs: The Subgraph Problem
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 131-159
-
- Article
- Export citation
- Cited by 124
Asymptotic Enumeration of Spanning Trees
-
- Published online by Cambridge University Press:
- 21 July 2005, pp. 491-522
-
- Article
- Export citation
- Cited by 122
Quasirandom Groups
-
- Published online by Cambridge University Press:
- 01 May 2008, pp. 363-387
-
- Article
- Export citation
- Cited by 109
Some Inequalities for the Largest Eigenvalue of a Graph
-
- Published online by Cambridge University Press:
- 25 April 2002, pp. 179-189
-
- Article
- Export citation
- Cited by 105
The Probability That a Random Multigraph is Simple
-
- Published online by Cambridge University Press:
- 01 March 2009, pp. 205-225
-
- Article
- Export citation
- Cited by 100
Paths, Stars and the Number Three
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 277-295
-
- Article
- Export citation
- Cited by 99
On the Minimal Density of Triangles in Graphs
-
- Published online by Cambridge University Press:
- 01 July 2008, pp. 603-618
-
- Article
- Export citation
- Cited by 96
The Largest Eigenvalue of Sparse Random Graphs
-
- Published online by Cambridge University Press:
- 28 January 2003, pp. 61-72
-
- Article
- Export citation
- Cited by 91
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
-
- Published online by Cambridge University Press:
- 20 September 2006, pp. 1-4
-
- Article
- Export citation
- Cited by 91
Topological cliques in graphs II
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 79-90
-
- Article
- Export citation
- Cited by 91
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
-
- Published online by Cambridge University Press:
- 03 January 2006, pp. 143-184
-
- Article
- Export citation
- Cited by 91
An Entropy Approach to the Hard-Core Model on Bipartite Graphs
-
- Published online by Cambridge University Press:
- 25 June 2001, pp. 219-237
-
- Article
- Export citation