Paper
Ramsey-type numbers involving graphs and hypergraphs with large girth
- Part of:
-
- Published online by Cambridge University Press:
- 12 April 2021, pp. 722-740
-
- Article
- Export citation
A non-increasing tree growth process for recursive trees and applications
- Part of:
-
- Published online by Cambridge University Press:
- 19 October 2020, pp. 79-104
-
- Article
- Export citation
The minimum perfect matching in pseudo-dimension 0 < q < 1
- Part of:
-
- Published online by Cambridge University Press:
- 27 October 2020, pp. 374-397
-
- Article
-
- You have access
- Open access
- Export citation
Hamiltonian Berge cycles in random hypergraphs
- Part of:
-
- Published online by Cambridge University Press:
- 08 September 2020, pp. 228-238
-
- Article
- Export citation
Breaking bivariate records
- Part of:
-
- Published online by Cambridge University Press:
- 18 August 2020, pp. 105-123
-
- Article
- Export citation
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
- Part of:
-
- Published online by Cambridge University Press:
- 12 April 2021, pp. 905-921
-
- Article
- Export citation
A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy
- Part of:
-
- Published online by Cambridge University Press:
- 26 October 2020, pp. 398-411
-
- Article
- Export citation
Finding tight Hamilton cycles in random hypergraphs faster
- Part of:
-
- Published online by Cambridge University Press:
- 23 September 2020, pp. 239-257
-
- Article
- Export citation
On the Erdős–Sós conjecture for trees with bounded degree
- Part of:
-
- Published online by Cambridge University Press:
- 01 February 2021, pp. 741-761
-
- Article
- Export citation
Near-perfect clique-factors in sparse pseudorandom graphs
- Part of:
-
- Published online by Cambridge University Press:
- 11 December 2020, pp. 570-590
-
- Article
- Export citation
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
- Part of:
-
- Published online by Cambridge University Press:
- 19 November 2020, pp. 591-608
-
- Article
-
- You have access
- Open access
- Export citation
Eigenvalues and triangles in graphs
- Part of:
-
- Published online by Cambridge University Press:
- 28 September 2020, pp. 258-270
-
- Article
- Export citation
Extremal problems for GCDs
- Part of:
-
- Published online by Cambridge University Press:
- 08 April 2021, pp. 922-929
-
- Article
-
- You have access
- Open access
- Export citation
Full rainbow matchings in graphs and hypergraphs
- Part of:
-
- Published online by Cambridge University Press:
- 20 January 2021, pp. 762-780
-
- Article
- Export citation
Approximately counting bases of bicircular matroids
- Part of:
-
- Published online by Cambridge University Press:
- 06 August 2020, pp. 124-135
-
- Article
- Export citation
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Part of:
-
- Published online by Cambridge University Press:
- 12 October 2020, pp. 412-443
-
- Article
-
- You have access
- Open access
- Export citation
The number of maximum primitive sets of integers
- Part of:
-
- Published online by Cambridge University Press:
- 28 January 2021, pp. 781-795
-
- Article
- Export citation
Additive bases via Fourier analysis
- Part of:
-
- Published online by Cambridge University Press:
- 29 April 2021, pp. 930-941
-
- Article
- Export citation
Monochromatic cycle partitions in random graphs
- Part of:
-
- Published online by Cambridge University Press:
- 14 August 2020, pp. 136-152
-
- Article
-
- You have access
- Open access
- Export citation
A discrepancy version of the Hajnal–Szemerédi theorem
- Part of:
-
- Published online by Cambridge University Press:
- 30 October 2020, pp. 444-459
-
- Article
- Export citation