25 results
Subsets of $\mathbb {F}_p^n\times \mathbb {F}_p^n$ without L-shaped configurations
- Part of
-
- Journal:
- Compositio Mathematica / Volume 160 / Issue 1 / January 2024
- Published online by Cambridge University Press:
- 04 December 2023, pp. 176-236
- Print publication:
- January 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Threshold graphs maximise homomorphism densities
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 33 / Issue 3 / May 2024
- Published online by Cambridge University Press:
- 29 November 2023, pp. 300-318
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
The codegree Turán density of tight cycles minus one edge
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 32 / Issue 6 / November 2023
- Published online by Cambridge University Press:
- 05 July 2023, pp. 881-884
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Intersection theorems for finite general linear groups
- Part of
-
- Journal:
- Mathematical Proceedings of the Cambridge Philosophical Society / Volume 175 / Issue 1 / July 2023
- Published online by Cambridge University Press:
- 16 February 2023, pp. 129-160
- Print publication:
- July 2023
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Curves on the torus intersecting at most k times
- Part of
-
- Journal:
- Mathematical Proceedings of the Cambridge Philosophical Society / Volume 174 / Issue 3 / May 2023
- Published online by Cambridge University Press:
- 15 November 2022, pp. 569-584
- Print publication:
- May 2023
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 5 / September 2021
- Published online by Cambridge University Press:
- 27 January 2021, pp. 796-799
-
- Article
- Export citation
The length of an s-increasing sequence of r-tuples
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 5 / September 2021
- Published online by Cambridge University Press:
- 08 January 2021, pp. 686-721
-
- Article
- Export citation
A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 26 October 2020, pp. 398-411
-
- Article
- Export citation
Covering and tiling hypergraphs with tight cycles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 13 October 2020, pp. 288-329
-
- Article
- Export citation
Maker–Breaker percolation games I: crossing grids
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 15 September 2020, pp. 200-227
-
- Article
-
- You have access
- Open access
- Export citation
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 09 September 2020, pp. 175-199
-
- Article
-
- You have access
- Open access
- Export citation
Turán numbers of theta graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 4 / July 2020
- Published online by Cambridge University Press:
- 13 February 2020, pp. 495-507
-
- Article
- Export citation
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 3 / May 2020
- Published online by Cambridge University Press:
- 27 November 2019, pp. 423-435
-
- Article
- Export citation
The Induced Removal Lemma in Sparse Graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 1 / January 2020
- Published online by Cambridge University Press:
- 30 September 2019, pp. 153-162
-
- Article
- Export citation
A fast new algorithm for weak graph regularity
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 03 May 2019, pp. 777-790
-
- Article
- Export citation
THE MAXIMUM SIZE OF $(k,l)$-SUM-FREE SETS IN CYCLIC GROUPS
- Part of
-
- Journal:
- Bulletin of the Australian Mathematical Society / Volume 99 / Issue 2 / April 2019
- Published online by Cambridge University Press:
- 26 December 2018, pp. 184-194
- Print publication:
- April 2019
-
- Article
-
- You have access
- Export citation
An Extremal Graph Problem with a Transcendental Solution
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 2 / March 2019
- Published online by Cambridge University Press:
- 26 June 2018, pp. 303-324
-
- Article
- Export citation
Convex Polygons in Geometric Triangulations†
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 5 / September 2017
- Published online by Cambridge University Press:
- 30 May 2017, pp. 641-659
-
- Article
- Export citation
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves†
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 25 / Issue 6 / November 2016
- Published online by Cambridge University Press:
- 04 May 2016, pp. 941-958
-
- Article
- Export citation
A Bound on the Number of Edges in Graphs Without an Even Cycle
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 1 / January 2017
- Published online by Cambridge University Press:
- 07 April 2016, pp. 1-15
-
- Article
- Export citation