About
I am a DPhil (PhD) mathematics student at the University of Oxford working in combinatorics. My supervisor is 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
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)
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)
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)
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)
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)
Reconstructing trees from small cards, arXiv:2103.13359, submitted (with Carla Groenland, Tom Johnston and Alex Scott)
Reconstructing the degree sequence of a sparse graph from a partial deck, arXiv:2102.08679, to appear in J. Combin. Theory Ser. B (with Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks and Alex Scott)
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)
A note on infinite antichain density, arXiv:2102.00246, SIAM Journal on Discrete Mathematics 36 (2022) (with Paul Balister, Emil Powierski and Alex Scott)
Eulerian circuits and path decompositions in quartic planar graphs, arXiv:1910.02819, submitted.
Small 4-regular planar graphs that are not circle representable, Australas. J. Combin., 76 (2020), 428-435. (pdf)
Talks
- July 2022, British Combinatorial Conference (slides)
- May 2022, Student Symposium in Combinatorics (info)
- March 2022, Barbados Graph Theory Workshop
- February 2022, UCL Combinatorics Seminar (info)
- November 2021, UCSD ABACUS Graduate Combinatorics Seminar (info) (board)
- November 2021, LSE PhD Seminar (info) (slides)
- July 2021, British Combinatorial Conference (slides)
- April 2021, MSI Colloquium at ANU (info) (slides)
- December 2019, 42ACCMCC at UNSW Sydney (slides)
- February 2019, Combinatorics Seminar at UNSW Sydney (info)
- December 2017, 5th International Combinatorics Conference at Monash University (slides)
Teaching
Here is some information on revision classes for C8.3 Combinatorics in Trinity.
Notes and projects
- A 10-step guide to the Serre spectral sequence
- My undergraduate Honours thesis on quartic planar graphs
- An introduction to computing stable stems, written as part of an AMSI summer project
Original design by Andreas Viklund