Ramsey number of a cycle versus a graph of a given size, with Stijn Cambie, Patryk Morawski, Kalina Petrova and Alexey Pokrovskiy.
Matchings avoiding ordered patterns, with János Barát and Géza Tóth.
A note on improved bounds for hypergraph rainbow matching problems, with Candida Bowtell, Gal Kronenberg and Jun Yan.
Typical Ramsey properties of the primes, abelian groups and other discrete structures , with Robert Hancock and Andrew Treglown.
The asymptotic behaviour of sat(n,F), with Asier Calbet.
Ramsey-type problems for tilings in dense graphs, with József Balogh and Andrew Treglown. European Journal of Combinatorics, 131 (2026), 104228, 21 pages.
An oriented discrepancy version of Dirac's theorem, with Allan Lo. Journal of Combinatorial Theory, Series B, 169 (2024), 338-351.
The induced saturation problem for posets, with Simón Piga, Maryam Sharifzadeh and Andrew Treglown. Combinatorial Theory, 3 (2023), #9, 15 pages.
Dirac-type results for tilings and coverings in ordered graphs, with Andrew Treglown. Forum of Mathematics, Sigma, 10 (2022), e104, 41 pages.
On deficiency problems for graphs, with Joseph Hyde and Andrew Treglown. Combinatorics, Probability and Computing, 31 (2022), 478-488.
A note on color-bias Hamilton cycles in dense graphs, with Joseph Hyde, Joanna Lada and Andrew Treglown. SIAM Journal on Discrete Mathematics, 35 (2021), 970-975.