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 46
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
-
- Published online by Cambridge University Press:
- 01 December 1998, pp. 375-386
-
- Article
- Export citation
- Cited by 46
A Characterization of Easily Testable Induced Subgraphs
-
- Published online by Cambridge University Press:
- 14 August 2006, pp. 791-805
-
- Article
- Export citation
- Cited by 45
Perturbed Identity Matrices Have High Rank: Proof and Applications
-
- Published online by Cambridge University Press:
- 01 March 2009, pp. 3-15
-
- Article
- Export citation
- Cited by 45
Quickselect and the Dickman Function
-
- Published online by Cambridge University Press:
- 06 September 2002, pp. 353-371
-
- Article
- Export citation
- Cited by 45
Lagrangians of Hypergraphs
-
- Published online by Cambridge University Press:
- 25 April 2002, pp. 199-216
-
- Article
- Export citation
- Cited by 44
t-Covering Arrays: Upper Bounds and Poisson Approximations
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 105-117
-
- Article
- Export citation
- Cited by 44
The Phase Transition in the Configuration Model
-
- Published online by Cambridge University Press:
- 02 February 2012, pp. 265-299
-
- Article
- Export citation
- Cited by 44
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
-
- Published online by Cambridge University Press:
- 01 December 1998, pp. 423-436
-
- Article
- Export citation
- Cited by 43
Bootstrap Percolation in High Dimensions
-
- Published online by Cambridge University Press:
- 12 August 2010, pp. 643-692
-
- Article
- Export citation
- Cited by 42
The Computational Complexity of the Tutte Plane: the Bipartite Case
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 181-187
-
- Article
- Export citation
- Cited by 42
The Complexity of Ferromagnetic Ising with Local Fields
-
- Published online by Cambridge University Press:
- 14 August 2006, pp. 43-61
-
- Article
- Export citation
- Cited by 41
Eigenvalues and triangles in graphs
- Part of:
-
- Published online by Cambridge University Press:
- 28 September 2020, pp. 258-270
-
- Article
- Export citation
- Cited by 41
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
-
- Published online by Cambridge University Press:
- 01 September 1998, pp. 307-321
-
- Article
- Export citation
- Cited by 41
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
-
- Published online by Cambridge University Press:
- 15 February 2005, pp. 225-247
-
- Article
- Export citation
- Cited by 40
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
-
- Published online by Cambridge University Press:
- 01 September 1997, pp. 295-313
-
- Article
- Export citation
- Cited by 39
On Increasing Subsequences of I.I.D. Samples
-
- Published online by Cambridge University Press:
- 01 May 1999, pp. 247-263
-
- 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
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 39
Bipartite Subgraphs and the Smallest Eigenvalue
-
- Published online by Cambridge University Press:
- 01 January 2000, pp. 1-12
-
- 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