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 21
Upper Bounds for the Connective Constant of Self-Avoiding Walks
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 115-136
-
- Article
- Export citation
- Cited by 21
Maximizing the Number of Independent Sets of a Fixed Size
-
- Published online by Cambridge University Press:
- 14 October 2014, pp. 521-527
-
- Article
- Export citation
- Cited by 20
On Dependency Graphs and the Lattice Gas
-
- Published online by Cambridge University Press:
- 03 January 2006, pp. 253-279
-
- Article
- Export citation
- Cited by 20
Longest Paths in Circular Arc Graphs
-
- Published online by Cambridge University Press:
- 28 April 2004, pp. 311-317
-
- Article
- Export citation
- Cited by 20
Online Conflict-Free Colouring for Hypergraphs
-
- Published online by Cambridge University Press:
- 11 December 2009, pp. 493-516
-
- Article
- Export citation
- Cited by 20
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
-
- Published online by Cambridge University Press:
- 01 March 2009, pp. 165-203
-
- Article
- Export citation
- Cited by 20
Extensions of the Erdős–Gallai theorem and Luo’s theorem
- Part of:
-
- Published online by Cambridge University Press:
- 08 October 2019, pp. 128-136
-
- Article
- Export citation
- Cited by 20
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
-
- Published online by Cambridge University Press:
- 06 September 2002, pp. 403-426
-
- Article
- Export citation
- Cited by 20
Function Learning from Interpolation
-
- Published online by Cambridge University Press:
- 01 May 2000, pp. 213-225
-
- Article
- Export citation
- Cited by 20
Comparisons in Hoare's Find Algorithm
-
- Published online by Cambridge University Press:
- 01 March 1998, pp. 111-120
-
- Article
- Export citation
- Cited by 20
A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- Part of:
-
- Published online by Cambridge University Press:
- 23 January 2017, pp. 321-337
-
- Article
- Export citation
- Cited by 20
Deterministic Graph Games and a Probabilistic Intuition
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 13-26
-
- Article
- Export citation
- Cited by 20
Conflict-Free Colouring of Graphs
-
- Published online by Cambridge University Press:
- 29 November 2013, pp. 434-448
-
- Article
- Export citation
- Cited by 20
Pólya Urns Via the Contraction Method
-
- Published online by Cambridge University Press:
- 01 September 2014, pp. 1148-1186
-
- Article
- Export citation
- Cited by 20
Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
-
- Published online by Cambridge University Press:
- 31 July 2006, pp. 695-713
-
- Article
- Export citation
- Cited by 20
Duality in Infinite Graphs
-
- Published online by Cambridge University Press:
- 03 January 2006, pp. 75-90
-
- Article
- Export citation
- Cited by 20
Dependent Sets of Constant Weight Binary Vectors
-
- Published online by Cambridge University Press:
- 01 September 1997, pp. 263-271
-
- Article
- Export citation
- Cited by 20
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
-
- Published online by Cambridge University Press:
- 02 February 2012, pp. 179-186
-
- Article
- Export citation
- Cited by 20
Hamilton Cycles in Oriented Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 25-32
-
- Article
- Export citation
- Cited by 20
Optimizing LRU Caching for Variable Document Sizes
-
- Published online by Cambridge University Press:
- 24 September 2004, pp. 627-643
-
- Article
- Export citation