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 84
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. 347-361
-
- Article
- Export citation
- Cited by 79
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
-
- Published online by Cambridge University Press:
- 03 December 2003, pp. 477-494
-
- Article
- Export citation
- Cited by 77
Proof of the Van den Berg–Kesten Conjecture
-
- Published online by Cambridge University Press:
- 01 January 2000, pp. 27-32
-
- Article
- Export citation
- Cited by 75
Point Selections and Weak ε-Nets for Convex Hulls
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 189-200
-
- Article
- Export citation
- Cited by 74
Random Regular Graphs: Asymptotic Distributions and Contiguity
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 369-405
-
- Article
- Export citation
- Cited by 72
List Improper Colourings of Planar Graphs
-
- Published online by Cambridge University Press:
- 01 May 1999, pp. 293-299
-
- Article
- Export citation
- Cited by 72
Chromatic Roots are Dense in the Whole Complex Plane
-
- Published online by Cambridge University Press:
- 03 March 2004, pp. 221-261
-
- Article
- Export citation
- Cited by 72
On the Number of Incidences Between Points and Curves
-
- Published online by Cambridge University Press:
- 01 March 1998, pp. 121-127
-
- Article
- Export citation
- Cited by 72
Sampling Regular Graphs and a Peer-to-Peer Network
-
- Published online by Cambridge University Press:
- 01 July 2007, pp. 557-593
-
- Article
- Export citation
- Cited by 70
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- Part of:
-
- Published online by Cambridge University Press:
- 02 February 2016, pp. 500-559
-
- Article
- Export citation
- Cited by 70
The Maximum Degree of the Barabási–Albert Random Tree
-
- Published online by Cambridge University Press:
- 11 April 2005, pp. 339-348
-
- Article
- Export citation
- Cited by 68
On Triangle Contact Graphs†
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 233-246
-
- Article
- Export citation
- Cited by 68
Graph Partitioning via Adaptive Spectral Techniques
-
- Published online by Cambridge University Press:
- 13 November 2009, pp. 227-284
-
- Article
- Export citation
- Cited by 67
An Upper Bound on Zarankiewicz' Problem
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 29-33
-
- Article
- Export citation
- Cited by 65
Poisson–Dirichlet and GEM Invariant Distributions for Split-and-Merge Transformations of an Interval Partition
-
- Published online by Cambridge University Press:
- 09 October 2002, pp. 501-514
-
- Article
- Export citation
- Cited by 64
The Size of a Hypergraph and its Matching Number
-
- Published online by Cambridge University Press:
- 20 January 2012, pp. 442-450
-
- Article
- Export citation
- Cited by 64
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
-
- Published online by Cambridge University Press:
- 31 July 2006, pp. 715-730
-
- Article
- Export citation
- Cited by 64
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
-
- Published online by Cambridge University Press:
- 01 March 2008, pp. 265-270
-
- Article
- Export citation
- Cited by 60
The Number of Independent Sets in a Regular Graph
-
- Published online by Cambridge University Press:
- 13 November 2009, pp. 315-320
-
- Article
- Export citation
- Cited by 59
A Note on Vertex List Colouring
-
- Published online by Cambridge University Press:
- 02 October 2001, pp. 345-347
-
- Article
- Export citation