Publications and Preprints

  1. Universality for transversal powers of Hamilton cycles (with Emily Heath, Natasha Morrison and Shannon Ogden, submitted, arXiv:2510.18163)
  2. Proof of the Kohayakawa–Kreuter conjecture for the majority of cases (with Candida Bowtell and Robert Hancock, submitted, arXiv:2307.16760)
  3. An Approximate Counting Version of the Multidimensional Szemerédi Theorem (with Natalie Behague, Natasha Morrison, Jonathan A. Noel and Ashna Wright, Combinatorica, 45(4) (2025) Paper No. 42, 21)
  4. Thresholds for constrained Ramsey and anti-Ramsey problems (with Natalie Behague, Robert Hancock, Shoham Letzter and Natasha Morrison, European Journal of Combinatorics, 129 (2025) Paper No. 104159, 22)
  5. Turán Colourings in Off-Diagonal Ramsey Multiplicity (with Jonathan A. Noel and Jae-baek Lee, Electronic Journal of Combinatorics 32(2) (2025) Paper No. 2.14)
  6. Spanning trees in pseudorandom graphs via sorting networks (with Natasha Morrison, Alp Muyesser and Matías Pavez-Signé, Proceedings of the American Mathematical Society 153 (2025), 2353-2367)
  7. Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices (with Bruce Reed, Procedia Computer Science 223 (2023), 217-222)
  8. Disjoint isomorphic balanced clique subdivisions (with Irene Gil Fernández, Hong Liu, Oleg Pikhurko and Zhuo Wu, Journal of Combinatorial Theory, Series B, 161 (2023), 417-436)
  9. Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph (with Alberto Espuny-Díaz, accepted to European Journal of Combinatorics, arXiv:2205.08971)
  10. Ramsey numbers of cycles versus general graphs (with John Haslegrave, Jaehoon Kim and Hong Liu, Forum of Mathematics, Sigma, 11 (2023), E10)
  11. Towards the 0-statement of the Kohayakawa-Kreuter conjecture (Combinatorics, Probability and Computing, 32(2) (2023), 225-268)
  12. On deficiency problems for graphs (with Andrea Freschi and Andrew Treglown, Combinatorics, Probability and Computing, 31(3) (2022), 478-488)
  13. A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs (with Candida Bowtell, SIAM Journal on Discrete Mathematics, 36(2) (2022), 1038-1063)
  14. A note on colour-bias Hamilton cycles in dense graphs (with Andrea Freschi, Joanna Lada and Andrew Treglown, SIAM Journal on Discrete Mathematics 35(2) (2021), 970-975)
  15. A degree sequence version of the Kühn-Osthus tiling theorem (with Andrew Treglown, Electronic Journal of Combinatorics 27(3) (2020), #P3.48, 30 pages)
  16. A degree sequence Komlós theorem (with Hong Liu and Andrew Treglown, SIAM Journal on Discrete Mathematics 33 (2019), 2041-2061)