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 4
Matroids Having Small Circumference
-
- Published online by Cambridge University Press:
- 02 October 2001, pp. 349-360
-
- Article
- Export citation
- Cited by 4
On Even-Degree Subgraphs of Linear Hypergraphs
-
- Published online by Cambridge University Press:
- 02 February 2012, pp. 113-127
-
- Article
- Export citation
- Cited by 4
Zero Biasing and Jack Measures
-
- Published online by Cambridge University Press:
- 20 June 2011, pp. 753-762
-
- Article
- Export citation
- Cited by 4
Supersaturation of even linear cycles in linear hypergraphs
- Part of:
-
- Published online by Cambridge University Press:
- 23 June 2020, pp. 698-721
-
- Article
- Export citation
- Cited by 4
An asymptotic bound for the strong chromatic number
- Part of:
-
- Published online by Cambridge University Press:
- 15 March 2019, pp. 768-776
-
- Article
- Export citation
- Cited by 4
Improved lower bound for the list chromatic number of graphs with no Kt minor
- Part of:
-
- Published online by Cambridge University Press:
- 30 May 2022, pp. 1070-1075
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 4
On Cancellative Set Families
-
- Published online by Cambridge University Press:
- 01 September 2007, pp. 767-773
-
- Article
- Export citation
- Cited by 4
On Active and Passive Testing
-
- Published online by Cambridge University Press:
- 04 January 2016, pp. 1-20
-
- Article
- Export citation
- Cited by 4
Large triangle packings and Tuza’s conjecture in sparse random graphs
- Part of:
-
- Published online by Cambridge University Press:
- 22 July 2020, pp. 757-779
-
- Article
- Export citation
- Cited by 4
Computing Norms of Group-Invariant Transition Operators
-
- Published online by Cambridge University Press:
- 12 September 2008, pp. 161-178
-
- Article
- Export citation
- Cited by 4
On the Evolution of Triangle-Free Graphs
-
- Published online by Cambridge University Press:
- 15 February 2005, pp. 211-224
-
- Article
- Export citation
- Cited by 4
Lower bound on the size of a quasirandom forcing set of permutations
- Part of:
-
- Published online by Cambridge University Press:
- 27 July 2021, pp. 304-319
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 4
On Turán exponents of bipartite graphs
- Part of:
-
- Published online by Cambridge University Press:
- 04 August 2021, pp. 333-344
-
- Article
- Export citation
- Cited by 4
Decomposing edge-coloured graphs under colour degree constraints
- Part of:
-
- Published online by Cambridge University Press:
- 01 March 2019, pp. 755-767
-
- Article
- Export citation
- Cited by 4
A Counter-Intuitive Correlation in a Random Tournament
-
- Published online by Cambridge University Press:
- 13 May 2010, pp. 1-9
-
- Article
- Export citation
- Cited by 4
Bipartite Coverings of Graphs
-
- Published online by Cambridge University Press:
- 01 September 1997, pp. 349-352
-
- Article
- Export citation
- Cited by 4
The Compensation Approach for Walks With Small Steps in the Quarter Plane
-
- Published online by Cambridge University Press:
- 11 January 2013, pp. 161-183
-
- Article
- Export citation
- Cited by 4
A Combinatorial Approach to Small Ball Inequalities for Sums and Differences
- Part of:
-
- Published online by Cambridge University Press:
- 06 November 2018, pp. 100-129
-
- Article
- Export citation
- Cited by 4
Product structure of graph classes with bounded treewidth
- Part of:
-
- Published online by Cambridge University Press:
- 07 December 2023, pp. 351-376
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 4
Turán-type results for intersection graphs of boxes
- Part of:
-
- Published online by Cambridge University Press:
- 19 May 2021, pp. 982-987
-
- Article
-
- You have access
- Open access
- Export citation