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 531
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. 295305

 Article
 Export citation

 Cited by 369
Combinatorial Nullstellensatz
 Published online by Cambridge University Press: 01 January 1999, pp. 729

 Article
 Export citation

 Cited by 233
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
 Published online by Cambridge University Press: 12 September 2008, pp. 351370

 Article
 Export citation

 Cited by 159
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
 Published online by Cambridge University Press: 01 September 1997, pp. 353358

 Article
 Export citation

 Cited by 141
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions†
 Published online by Cambridge University Press: 09 January 2013, pp. 294318

 Article
 Export citation

 Cited by 137
A DiracType Theorem for 3Uniform Hypergraphs
 Published online by Cambridge University Press: 03 January 2006, pp. 229251

 Article
 Export citation

 Cited by 135
Generating Random Regular Graphs Quickly
 Published online by Cambridge University Press: 01 July 1999, pp. 377396

 Article
 Export citation

 Cited by 128
On Random Intersection Graphs: The Subgraph Problem
 Published online by Cambridge University Press: 01 January 1999, pp. 131159

 Article
 Export citation

 Cited by 125
Boltzmann Samplers for the Random Generation of Combinatorial Structures
 Published online by Cambridge University Press: 24 September 2004, pp. 577625

 Article
 Export citation

 Cited by 115
Asymptotic Enumeration of Spanning Trees
 Published online by Cambridge University Press: 21 July 2005, pp. 491522

 Article
 Export citation

 Cited by 103
Quasirandom Groups
 Published online by Cambridge University Press: 01 May 2008, pp. 363387

 Article
 Export citation

 Cited by 99
The Probability That a Random Multigraph is Simple
 Published online by Cambridge University Press: 01 March 2009, pp. 205225

 Article
 Export citation

 Cited by 96
On the Minimal Density of Triangles in Graphs
 Published online by Cambridge University Press: 01 July 2008, pp. 603618

 Article
 Export citation

 Cited by 92
Paths, Stars and the Number Three
 Published online by Cambridge University Press: 12 September 2008, pp. 277295

 Article
 Export citation

 Cited by 88
The Largest Eigenvalue of Sparse Random Graphs
 Published online by Cambridge University Press: 28 January 2003, pp. 6172

 Article
 Export citation

 Cited by 87
Some Inequalities for the Largest Eigenvalue of a Graph
 Published online by Cambridge University Press: 25 April 2002, pp. 179189

 Article
 Export citation

 Cited by 86
Quasirandomness, Counting and Regularity for 3Uniform Hypergraphs
 Published online by Cambridge University Press: 03 January 2006, pp. 143184

 Article
 Export citation

 Cited by 85
An Entropy Approach to the HardCore Model on Bipartite Graphs
 Published online by Cambridge University Press: 25 June 2001, pp. 219237

 Article
 Export citation

 Cited by 84
The Minimum Feedback Arc Set Problem is NPHard for Tournaments
 Published online by Cambridge University Press: 20 September 2006, pp. 14

 Article
 Export citation

 Cited by 80
One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
 Published online by Cambridge University Press: 01 July 1999, pp. 347361

 Article
 Export citation
