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 7
Tutte Polynomials of Perfect Matroid Designs
-
- Published online by Cambridge University Press:
- 03 November 2000, pp. 363-367
-
- Article
- Export citation
- Cited by 7
On a Random Graph Related to Quantum Theory
-
- Published online by Cambridge University Press:
- 01 September 2007, pp. 757-766
-
- Article
- Export citation
- Cited by 7
A Bijective Proof of a Theorem of Knuth
-
- Published online by Cambridge University Press:
- 21 July 2010, pp. 11-25
-
- Article
- Export citation
- Cited by 7
Triangle Density and Contractibility
-
- Published online by Cambridge University Press:
- 15 February 2005, pp. 133-146
-
- Article
- Export citation
- Cited by 7
Sums of Dilates in
p
-
- Published online by Cambridge University Press:
- 30 October 2012, pp. 282-293
-
- Article
- Export citation
- Cited by 7
Expanders Are Universal for the Class of All Spanning Trees
-
- Published online by Cambridge University Press:
- 03 January 2013, pp. 253-281
-
- Article
- Export citation
- Cited by 7
Negative Correlation in Graphs and Matroids
-
- Published online by Cambridge University Press:
- 01 May 2008, pp. 423-435
-
- Article
- Export citation
- Cited by 7
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
-
- Published online by Cambridge University Press:
- 01 September 2007, pp. 733-746
-
- Article
- Export citation
- Cited by 7
Adding Distinct Congruence Classes
-
- Published online by Cambridge University Press:
- 01 March 1998, pp. 81-87
-
- Article
- Export citation
- Cited by 7
When is an Almost Monochromatic K4 Guaranteed?
-
- Published online by Cambridge University Press:
- 01 November 2008, pp. 823-830
-
- Article
- Export citation
- Cited by 7
Separation Choosability and Dense Bipartite Induced Subgraphs
- Part of:
-
- Published online by Cambridge University Press:
- 26 February 2019, pp. 720-732
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 7
Greedy Random Walk
-
- Published online by Cambridge University Press:
- 20 November 2013, pp. 269-289
-
- Article
- Export citation
- Cited by 7
Predecessors in Random Mappings
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 317-335
-
- Article
- Export citation
- Cited by 7
On Restricted Sums
-
- Published online by Cambridge University Press:
- 09 April 2001, pp. 513-518
-
- Article
- Export citation
- Cited by 7
Edge-statistics on large graphs
- Part of:
-
- Published online by Cambridge University Press:
- 14 November 2019, pp. 163-189
-
- Article
- Export citation
- Cited by 7
Simply Generated Non-Crossing Partitions
-
- Published online by Cambridge University Press:
- 28 March 2017, pp. 560-592
-
- Article
- Export citation
- Cited by 7
On Subgraph Sizes in Random Graphs
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 123-134
-
- Article
- Export citation
- Cited by 7
Simple Containers for Simple Hypergraphs
- Part of:
-
- Published online by Cambridge University Press:
- 17 August 2015, pp. 448-459
-
- Article
- Export citation
- Cited by 7
The Entropy of Random-Free Graphons and Properties
-
- Published online by Cambridge University Press:
- 16 May 2013, pp. 517-526
-
- Article
- Export citation
- Cited by 7
Tight Bounds for Blind Search on the Integers and the Reals
-
- Published online by Cambridge University Press:
- 18 December 2009, pp. 711-728
-
- Article
- Export citation