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 26
Factors of IID on Trees
-
- Published online by Cambridge University Press:
- 06 December 2016, pp. 285-300
-
- Article
- Export citation
- Cited by 26
Sums of Dilates
-
- Published online by Cambridge University Press:
- 01 September 2008, pp. 627-639
-
- Article
- Export citation
- Cited by 26
Asymptotic Enumeration of Constellations and Related Families of Maps on Orientable Surfaces
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 477-516
-
- Article
- Export citation
- Cited by 26
A Stronger Bound for the Strong Chromatic Index
-
- Published online by Cambridge University Press:
- 19 July 2017, pp. 21-43
-
- Article
- Export citation
- Cited by 26
MaxCut in ${\bm H)$-Free Graphs
-
- Published online by Cambridge University Press:
- 11 October 2005, pp. 629-647
-
- Article
- Export citation
- Cited by 26
Packing Circuits into KN
-
- Published online by Cambridge University Press:
- 10 December 2001, pp. 463-499
-
- Article
- Export citation
- Cited by 26
Conditional Independences among Four Random Variables II
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 407-417
-
- Article
- Export citation
- Cited by 26
Studying Balanced Allocations with Differential Equations
-
- Published online by Cambridge University Press:
- 01 September 1999, pp. 473-482
-
- Article
- Export citation
- Cited by 25
On the Strong Chromatic Number
-
- Published online by Cambridge University Press:
- 03 November 2004, pp. 857-865
-
- Article
- Export citation
- Cited by 25
Eigenvalues of Graphs and Sobolev Inequalities
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 11-25
-
- Article
- Export citation
- Cited by 25
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
-
- Published online by Cambridge University Press:
- 14 February 2002, pp. 103-111
-
- Article
- Export citation
- Cited by 25
Better Bounds for k-Partitions of Graphs
-
- Published online by Cambridge University Press:
- 31 May 2011, pp. 631-640
-
- Article
- Export citation
- Cited by 25
Self-Avoiding Walks on Hyperbolic Graphs
-
- Published online by Cambridge University Press:
- 21 July 2005, pp. 523-548
-
- Article
- Export citation
- Cited by 25
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
-
- Published online by Cambridge University Press:
- 02 February 2012, pp. 141-148
-
- Article
- Export citation
- Cited by 25
Conditional Independences among Four Random Variables I*
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 269-278
-
- Article
- Export citation
- Cited by 25
A Bound on the Number of Edges in Graphs Without an Even Cycle
- Part of:
-
- Published online by Cambridge University Press:
- 07 April 2016, pp. 1-15
-
- Article
- Export citation
- Cited by 25
Perfect Matchings in Random r-regular, s-uniform Hypergraphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 1-14
-
- Article
- Export citation
- Cited by 25
The Distribution of Heights of Binary Trees and Other Simple Trees
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 145-156
-
- Article
- Export citation
- Cited by 25
Unit Distances in Three Dimensions
-
- Published online by Cambridge University Press:
- 25 April 2012, pp. 597-610
-
- Article
- Export citation
- Cited by 24
Interval Packing and Covering in the Boolean Lattice
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 373-384
-
- Article
- Export citation