| Publication | Date of Publication | Type |
|---|
| The rainbow saturation number is linear | 2024-04-23 | Paper |
| Rainbow subdivisions of cliques | 2024-03-25 | Paper |
| Rainbow subgraphs of uniformly coloured randomly perturbed graphs | 2023-10-27 | Paper |
| Ascending Subgraph Decomposition | 2023-08-22 | Paper |
| An improvement on Łuczak's connected matchings method | 2023-08-18 | Paper |
| Pancyclicity of highly connected graphs | 2023-06-21 | Paper |
| Directed cycles with zero weight in $\mathbb{Z}_p^k$ | 2023-06-15 | Paper |
| Cycle partitions of regular graphs | 2023-03-30 | Paper |
| Hypergraphs with no tight cycles | 2022-12-09 | Paper |
| Large Rainbow Cliques in Randomly Perturbed Dense Graphs | 2022-12-09 | Paper |
| Separating paths systems of almost linear size | 2022-11-14 | Paper |
| Partitioning a tournament into sub-tournaments of high connectivity | 2022-10-31 | Paper |
| Decomposing cubic graphs into isomorphic linear forests | 2022-10-20 | Paper |
| The Tur\'an density of tight cycles in three-uniform hypergraphs | 2022-09-16 | Paper |
| Chi-boundedness of graphs containing no cycles with $k$ chords | 2022-08-31 | Paper |
| Small rainbow cliques in randomly perturbed dense graphs | 2022-01-13 | Paper |
| The size-Ramsey number of 3-uniform tight paths | 2021-11-05 | Paper |
| Immersion of complete digraphs in Eulerian digraphs | 2021-08-31 | Paper |
| Lagrangians of hypergraphs. II: When colex is best | 2021-07-12 | Paper |
| Monochromatic trees in random tournaments | 2021-06-15 | Paper |
| Size-Ramsey numbers of powers of hypergraph trees and long subdivisions | 2021-03-02 | Paper |
| Minimum degree conditions for monochromatic cycle partitioning | 2021-02-03 | Paper |
| Orthonormal representations of \(H\)-free graphs | 2020-10-23 | Paper |
| Monochromatic triangle packings in red-blue graphs | 2020-08-12 | Paper |
| Fractional triangle decompositions in almost complete graphs | 2020-08-12 | Paper |
| 3‐Color bipartite Ramsey number of cycles and paths | 2020-07-17 | Paper |
| The oriented size Ramsey number of directed paths | 2020-06-16 | Paper |
| On existentially complete triangle-free graphs | 2020-05-20 | Paper |
| Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false | 2020-04-02 | Paper |
| Many H-Copies in Graphs with a Forbidden Tree | 2019-12-09 | Paper |
| Product-free sets in the free semigroup | 2019-11-28 | Paper |
| Optimal Adaptive Detection of Monotone Patterns | 2019-11-04 | Paper |
| Multicolour bipartite Ramsey number of paths | 2019-09-30 | Paper |
| Partitioning a graph into monochromatic connected subgraphs | 2019-08-15 | Paper |
| Directed Ramsey number for trees | 2019-07-17 | Paper |
| The homomorphism threshold of ‐free graphs | 2019-06-14 | Paper |
| Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) | 2019-03-05 | Paper |
| Monochromatic paths in random tournaments | 2019-02-20 | Paper |
| Product-free sets in the free semigroup | 2018-12-11 | Paper |
| Minimizing the Number of Triangular Edges | 2018-07-24 | Paper |
| Eigenvalues of subgraphs of the cube | 2018-04-25 | Paper |
| Monochromatic paths in random tournaments | 2018-01-18 | Paper |
| Directed Ramsey number for trees | 2018-01-18 | Paper |
| Longest common extension | 2017-11-14 | Paper |
| Path Ramsey Number for Random Graphs | 2017-10-10 | Paper |
| Radon numbers for trees | 2016-12-22 | Paper |
| Almost partitioning the hypercube into copies of a graph | 2016-12-14 | Paper |
| Large Monochromatic Triple Stars in Edge Colourings | 2016-02-01 | Paper |
| Separating path systems | 2014-12-22 | Paper |
| The property of having a k -regular subgraph has a sharp threshold | 2013-07-26 | Paper |
| Rainbow Hamiltonicity in uniformly coloured perturbed digraphs | 0001-01-03 | Paper |
| On a problem of Brown, Erd\H{o}s and S\'{o}s | 0001-01-03 | Paper |
| Thresholds for constrained Ramsey and anti-Ramsey problems | 0001-01-03 | Paper |
| Sublinear expanders and their applications | 0001-01-03 | Paper |
| Building graphs with high minimum degree on a budget | 0001-01-03 | Paper |
