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 12
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
-
- Published online by Cambridge University Press:
- 01 December 1998, pp. 437-449
-
- Article
- Export citation
- Cited by 12
Notes on Sum-Free and Related Sets
-
- Published online by Cambridge University Press:
- 01 January 1999, pp. 95-107
-
- Article
- Export citation
- Cited by 12
On the Rank of Random Sparse Matrices
-
- Published online by Cambridge University Press:
- 12 October 2009, pp. 321-342
-
- Article
- Export citation
- Cited by 12
Colourings of Uniform Hypergraphs with Large Girth and Applications
- Part of:
-
- Published online by Cambridge University Press:
- 09 October 2017, pp. 245-273
-
- Article
- Export citation
- Cited by 12
On the Brownian separable permuton
- Part of:
-
- Published online by Cambridge University Press:
- 24 October 2019, pp. 241-266
-
- Article
- Export citation
- Cited by 12
Locally Thin Set Families
-
- Published online by Cambridge University Press:
- 09 April 2001, pp. 481-488
-
- Article
- Export citation
- Cited by 12
Constructing Trees in Graphs whose Complement has no K2,s
-
- Published online by Cambridge University Press:
- 06 September 2002, pp. 343-347
-
- Article
- Export citation
- Cited by 12
Critical Window for Connectivity in the Configuration Model
- Part of:
-
- Published online by Cambridge University Press:
- 29 May 2017, pp. 660-680
-
- Article
- Export citation
- Cited by 12
Ore-type graph packing problems
-
- Published online by Cambridge University Press:
- 20 September 2006, pp. 167-169
-
- Article
- Export citation
- Cited by 12
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
- Part of:
-
- Published online by Cambridge University Press:
- 21 May 2018, pp. 81-99
-
- Article
- Export citation
- Cited by 12
Set Families With a Forbidden Induced Subposet
-
- Published online by Cambridge University Press:
- 22 March 2012, pp. 496-511
-
- Article
- Export citation
- Cited by 12
Enumeration Schemes for Restricted Permutations
-
- Published online by Cambridge University Press:
- 01 January 2008, pp. 137-159
-
- Article
- Export citation
- Cited by 12
A Tutte Polynomial for Maps
-
- Published online by Cambridge University Press:
- 12 April 2018, pp. 913-945
-
- Article
- Export citation
- Cited by 12
Local Limit Theorems for the Giant Component of Random Hypergraphs†
-
- Published online by Cambridge University Press:
- 13 February 2014, pp. 331-366
-
- Article
- Export citation
- Cited by 12
Upper Bounds for Online Ramsey Games in Random Graphs
-
- Published online by Cambridge University Press:
- 01 March 2009, pp. 259-270
-
- Article
- Export citation
- Cited by 12
The Distribution of Patterns in Random Trees
-
- Published online by Cambridge University Press:
- 01 January 2008, pp. 21-59
-
- Article
- Export citation
- Cited by 12
The Maximum Degree of a Random Graph
-
- Published online by Cambridge University Press:
- 09 April 2001, pp. 549-572
-
- Article
- Export citation
- Cited by 11
Some Local Extremal Connectivity Results for Matroids
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 367-384
-
- Article
- Export citation
- Cited by 11
The Tutte Polynomial for Matroids of Bounded Branch-Width
-
- Published online by Cambridge University Press:
- 07 April 2006, pp. 397-409
-
- Article
- Export citation
- Cited by 11
Adversarial Deletion in a Scale-Free Random Graph Process
-
- Published online by Cambridge University Press:
- 01 March 2007, pp. 261-270
-
- Article
- Export citation