About

I am a Post-Doctoral Research Fellow at All Souls College and an affiliate researcher at the Mathematical Institute, University of Oxford. I recently completed my DPhil (PhD) in Mathematics at Oxford working in combinatorics. My thesis, on Graph Reconstruction and Structure, was supervised by Alex Scott. Previously, I was an undergraduate at the Australian National University, where my Honours thesis in graph theory was supervised by Brendan McKay. While syncing academic years between hemispheres, I enjoyed support from Catherine Greenhill.

Research

Papers

19. A local limit theorem for the edge counts of random induced subgraphs of a random graph, arXiv:2503.23164, submitted (with Paul Balister, Emil Powierski and Alex Scott)

18. Tight Bounds for Hypercube Minor-Universality, arXiv:2502.06629, submitted (with Emma Hogan, Lukas Michel, Alex Scott, Youri Tamitegama and Dmitry Tsarev)

17. Colouring t-perfect graphs, arXiv:2412.17735, submitted (with Maria Chudnovsky, Linda Cook, James Davies and Sang-il Oum)

16. On high genus extensions of Negami’s conjecture, arXiv:2412.04420, submitted (with Marcin Briański and James Davies)

15. Clustered Colouring of Graph Products, arXiv:2407.21360, submitted (with Rutger Campbell, J. Pascal Gollin, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama, and David R. Wood)

14. When t-intersecting hypergraphs admit bounded c-strong colourings, arXiv:2406.13402, submitted (with Kevin Hendrey, Freddie Illingworth and Nina Kamčev)

13. A note on graphs of k-colourings, arXiv:2402.04237, submitted (with Emma Hogan, Alex Scott and Youri Tamitegama)

12. Boundary rigidity of 3D CAT(0) cube complexes, arXiv:2309.04385, submitted (with John Haslegrave, Alex Scott and Youri Tamitegama)

11. Product structure of graph classes with bounded treewidth, arXiv:2206.02395, submitted (with Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama and David R. Wood)

10. On comparable box dimension, Proc. 38th International Symposium on Computational Geometry (SoCG) 2022, 38:1-38:14. DOI:10.4230/LIPIcs.SoCG.2022.38 (with Zdenek Dvorák, Daniel Goncalves, Abhiruk Lahiri and Torsten Ueckerdt)

9. Induced subgraphs of induced subgraphs of large chromatic number, arXiv:2203.03612, submitted (with António Girão, Freddie Illingworth, Emil Powierski, Michael Savery, Alex Scott and Youri Tamitegama)

8. Decomposing random permutations into order-isomorphic subpermutations, arXiv:2202.10789, submitted (with Carla Groenland, Tom Johnston, Dániel Korándi, Alexander Roberts and Alex Scott)

7. Counting partitions of G(n,1/2) with degree congruence conditions, arXiv:2105.12612, to appear in Random Structures and Algorithms (with Paul Balister, Emil Powierski and Alex Scott)

6. Reconstructing trees from small cards, arXiv:2103.13359, submitted (with Carla Groenland, Tom Johnston and Alex Scott)

5. Reconstructing the degree sequence of a sparse graph from a partial deck, arXiv:2102.08679, J. Combin. Theory Ser. B, 157 (2022), 283-293 (with Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks and Alex Scott)

4. Graph pseudometrics from a topological point of view, Research in Computational Topology 2, Springer (2022). DOI:10.1007/978-3-030-95519-9_5 (with Ana Garcia-Pulido, Kathryn Hess, Kate Turner, Bei Wang and Naya Yerolemou)

3. A note on infinite antichain density, arXiv:2102.00246, SIAM Journal on Discrete Mathematics 36 (2022) (with Paul Balister, Emil Powierski and Alex Scott)

2. Eulerian circuits and path decompositions in quartic planar graphs, arXiv:1910.02819.

1. Small 4-regular planar graphs that are not circle representable, Australas. J. Combin., 76 (2020), 428-435. (pdf)

Talks

Teaching

I am taking revision for C8.3 Combinatorics and C8.4 Probabilistic Combinatorics in Trinity 2025.

Notes and projects