I am a Junior Research Fellow at New College, University of Oxford. I completed my PhD at the University College London in 2024 where I was supervised by Alexey Pokrovskiy. I'm broadly interested in probabilistic, extremal, and additive aspects of combinatorics, as well as interactions with group theory, graph theory, and theoretical computer science.

You can find here my list of publications. Below are some highlights. Here are also some (fairly incomplete) lecture notes on the absorption method based on a recent graduate course.

Selected works

• On Graham's rearrangement conjecture over 𝔽₂ⁿ
  with Benjamin Bedert, Matija Bucić, Noah Kravitz, and Richard Montgomery
• A random Hall-Paige conjecture
  Inventiones Mathematicae, 2025
  (also mentioned here)
  with Alexey Pokrovskiy
• Cycle type in Hall-Paige: A proof of the Friedlander-Gordon-Tannenbaum conjecture
• On the Graham-Sloane harmonious labelling conjecture
  with Alexey Pokrovskiy
• Approximate path decompositions of regular graphs
  Journal of the London Mathematical Society, 2025
  with Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
• Spanning trees in pseudorandom graphs via sorting networks
  Proceedings of the American Mathematical Society, 2025
  (also mentioned in a Quanta article)
  with Joseph Hyde, Natasha Morrison, and Matías Pavez-Signé
• Optimal spread for spanning subgraphs of Dirac hypergraphs
  Journal of Combinatorial Theory, Series B, 2024
  with Tom Kelly and Alexey Pokrovskiy
• Cyclic subsets in regular Dirac graphs
  IMRN, 2025
  (see here for a talk)
  with Nemanja Draganić and Peter Keevash
• Cycle-factors of regular graphs via entropy
  FOCS, 2025
  with Micha Christoph, Nemanja Draganić, António Girão, Eoin Hurley, and Lukas Michel

---

List of publications

• On the Graham-Sloane harmonious labelling conjecture
  with Alexey Pokrovskiy
• On Graham's rearrangement conjecture over 𝔽₂ⁿ
  with Benjamin Bedert, Matija Bucić, Noah Kravitz, and Richard Montgomery
• New bounds for linear arboricity and related problems
  with Micha Christoph, Nemanja Draganić, António Girão, Eoin Hurley, and Lukas Michel
• Cycle-factors of regular graphs via entropy
  FOCS, 2025
  with Micha Christoph, Nemanja Draganić, António Girão, Eoin Hurley, and Lukas Michel
• Cyclic subsets in regular Dirac graphs
  IMRN, 2025
  with Nemanja Draganić and Peter Keevash
• Towards Graham's rearrangement conjecture via rainbow paths
  with Matija Bucić, Bryce Frederickson, Alexey Pokrovskiy, and Liana Yepremyan
• Random embeddings of bounded degree trees with optimal spread
  Combinatorics, Probability, and Computing, to appear
  with Paul Bastide and Clément Legrand-Duchesne
• Topological minors in typical lifts
  with Matija Bucić, Micha Christoph, and Raphael Steiner
• Spanning spheres in Dirac hypergraphs
  Combinatorica, 2025
  with Freddie Illingworth, Richard Lang, Olaf Parczyk, and Amedeo Sgueglia
• Approximate path decompositions of regular graphs
  Journal of the London Mathematical Society, 2025
  with Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
• Spanning trees in pseudorandom graphs via sorting networks
  Proceedings of the American Mathematical Society, 2025
  with Joseph Hyde, Natasha Morrison, and Matías Pavez-Signé
• A random Hall-Paige conjecture
  Inventiones Mathematicae, 2025
  with Alexey Pokrovskiy
• Optimal spread for spanning subgraphs of Dirac hypergraphs
  Journal of Combinatorial Theory, Series B, 2024
  with Tom Kelly and Alexey Pokrovskiy
• Cycle type in Hall-Paige: A proof of the Friedlander-Gordon-Tannenbaum conjecture
• A general approach to transversal versions of Dirac-type theorems
  Bulletin of the London Mathematical Society, 2023
  with Pranshu Gupta, Fabian Hamann, Olaf Parczyk, and Amedeo Sgueglia
• Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
  Electronic Journal of Combinatorics, 2023
  with Michael Anastos, David Fabian, and Tibor Szabó
• Unavoidable patterns in locally balanced colorings
  Combinatorics, Probability, and Computing, 2023
  with Nina Kamčev
• Transversal factors and spanning trees
  Advances in Combinatorics, 2022
  with Richard Montgomery and Yani Pehova
• On a colored Turán problem of Diwan and Mubayi
  Discrete Mathematics, 2022
  with Ander Lamaison and Michael Tait
• Turán and Ramsey-type results for unavoidable subgraphs
  Journal of Graph Theory, 2022
  with Michael Tait
• Colored unavoidable patterns and balanceable graphs
  Electronic Journal of Combinatorics, 2023
  with Matt Bowen, Adriana Hansberg, and Amanda Montejano
• Finding unavoidable colorful patterns in multicolored graphs
  Electronic Journal of Combinatorics, 2020
  with Matt Bowen and Ander Lamaison
• Combining imagination and heuristics to learn strategies that generalize
  Neurons, Behavior, Data Analysis, and Theory, 2020
  with Kyle Dunovan, Erik Peterson and Timothy Verstynen
• The Sprague-Grundy function for some selective compound games
  Integers, 2020
  with Calvin Beideman and Matt Bowen