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 40
First Passage Percolation on the Erdős–Rényi Random Graph
-
- Published online by Cambridge University Press:
- 20 June 2011, pp. 683-707
-
- Article
- Export citation
- Cited by 40
Analysis of Top To Random Shuffles
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 135-155
-
- Article
- Export citation
- Cited by 40
Rainbow Turán Problems
-
- Published online by Cambridge University Press:
- 04 September 2006, pp. 109-126
-
- Article
- Export citation
- Cited by 40
The k-Core and Branching Processes
-
- Published online by Cambridge University Press:
- 01 January 2008, pp. 111-136
-
- Article
- Export citation
- Cited by 39
Homomorphism-Homogeneous Relational Structures
-
- Published online by Cambridge University Press:
- 03 January 2006, pp. 91-103
-
- Article
- Export citation
- Cited by 39
Spanning Subgraphs of Random Graphs
-
- Published online by Cambridge University Press:
- 01 March 2000, pp. 125-148
-
- Article
- Export citation
- Cited by 39
Turán Numbers of Multiple Paths and Equibipartite Forests
-
- Published online by Cambridge University Press:
- 12 October 2011, pp. 837-853
-
- Article
- Export citation
- Cited by 39
Deterministic Random Walks on the Two-Dimensional Grid
-
- Published online by Cambridge University Press:
- 01 March 2009, pp. 123-144
-
- Article
- Export citation
- Cited by 39
The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 97-126
-
- Article
- Export citation
- Cited by 38
On the Method of Typical Bounded Differences
- Part of:
-
- Published online by Cambridge University Press:
- 27 August 2015, pp. 269-299
-
- Article
- Export citation
- Cited by 38
Thresholds and Expectation Thresholds
-
- Published online by Cambridge University Press:
- 01 May 2007, pp. 495-502
-
- Article
- Export citation
- Cited by 38
Proof of a Packing Conjecture of Bollobás
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 241-255
-
- Article
- Export citation
- Cited by 38
The Wiener Index of Random Trees
-
- Published online by Cambridge University Press:
- 21 November 2002, pp. 587-597
-
- Article
- Export citation
- Cited by 38
Drift Analysis and Evolutionary Algorithms Revisited
-
- Published online by Cambridge University Press:
- 20 June 2018, pp. 643-666
-
- Article
- Export citation
- Cited by 37
On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
-
- Published online by Cambridge University Press:
- 03 December 2003, pp. 585-598
-
- Article
- Export citation
- Cited by 37
The Chromatic Number of Graph Powers
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 1-10
-
- Article
- Export citation
- Cited by 37
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
-
- Published online by Cambridge University Press:
- 20 May 2003, pp. 285-299
-
- Article
- Export citation
- Cited by 37
Choice Numbers of Graphs: a Probabilistic Approach
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 107-114
-
- Article
- Export citation
- Cited by 37
Applications of a New Separator Theorem for String Graphs
-
- Published online by Cambridge University Press:
- 25 October 2013, pp. 66-74
-
- Article
- Export citation
- Cited by 37
Three Thresholds for a Liar
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 81-93
-
- Article
- Export citation