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 5
On the mixing time of coordinate Hit-and-Run
- Part of:
-
- Published online by Cambridge University Press:
- 25 August 2021, pp. 320-332
-
- Article
- Export citation
- Cited by 5
Fast Unimodular Counting
-
- Published online by Cambridge University Press:
- 01 May 2000, pp. 277-285
-
- Article
- Export citation
- Cited by 5
Exact Minimum Codegree Threshold for K−4-Factors
-
- Published online by Cambridge University Press:
- 04 August 2017, pp. 856-885
-
- Article
- Export citation
- Cited by 5
A Combinatorial Approach to the Two-Sided Exit Problem for Left-Continuous Random Walks
-
- Published online by Cambridge University Press:
- 25 June 2001, pp. 251-266
-
- Article
- Export citation
- Cited by 5
A Sequence of Triangle-Free Pseudorandom Graphs
-
- Published online by Cambridge University Press:
- 13 September 2016, pp. 195-200
-
- Article
- Export citation
- Cited by 5
Expected Number of Distinct Part Sizes in a Random Integer Composition
-
- Published online by Cambridge University Press:
- 09 April 2001, pp. 519-527
-
- Article
- Export citation
- Cited by 5
Saturation in the Hypercube and Bootstrap Percolation
- Part of:
-
- Published online by Cambridge University Press:
- 31 March 2016, pp. 78-98
-
- Article
- Export citation
- Cited by 5
B2[g] Sets and a Conjecture of Schinzel and Schmidt
-
- Published online by Cambridge University Press:
- 01 November 2008, pp. 741-747
-
- Article
- Export citation
- Cited by 5
On a Correlation Inequality of Farr
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 157-160
-
- Article
- Export citation
- Cited by 5
(k+1)-Cores Have k-Factors
-
- Published online by Cambridge University Press:
- 11 September 2012, pp. 882-896
-
- Article
- Export citation
- Cited by 5
On Percolation and the Bunkbed Conjecture
-
- Published online by Cambridge University Press:
- 17 February 2010, pp. 103-117
-
- Article
- Export citation
- Cited by 4
On the size-Ramsey number of grid graphs
- Part of:
-
- Published online by Cambridge University Press:
- 06 April 2021, pp. 670-685
-
- Article
- Export citation
- Cited by 4
Winning Fast in Sparse Graph Construction Games
-
- Published online by Cambridge University Press:
- 01 November 2008, pp. 781-791
-
- Article
- Export citation
- Cited by 4
Limit Shapes via Bijections
- Part of:
-
- Published online by Cambridge University Press:
- 02 August 2018, pp. 187-240
-
- Article
- Export citation
- Cited by 4
Recovering Set Systems and Graph Entropy
-
- Published online by Cambridge University Press:
- 01 December 1997, pp. 481-491
-
- Article
- Export citation
- Cited by 4
The Random Connection Model on the Torus
-
- Published online by Cambridge University Press:
- 09 July 2014, pp. 796-804
-
- Article
- Export citation
- Cited by 4
Testing Odd-Cycle-Freeness in Boolean Functions
-
- Published online by Cambridge University Press:
- 10 August 2012, pp. 835-855
-
- Article
- Export citation
- Cited by 4
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
-
- Published online by Cambridge University Press:
- 23 January 2017, pp. 525-535
-
- Article
- Export citation
- Cited by 4
Maximum Waiting Times are Asymptotically Independent
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 251-264
-
- Article
- Export citation
- Cited by 4
Almost Odd Random Sum-Free Sets
-
- Published online by Cambridge University Press:
- 01 March 1998, pp. 27-32
-
- Article
- Export citation