Published
2025, “Sidorenko-type inequalities for pairs of trees”, with Gabriel Crudele, Jonathan A. Noel and Lina M. Simbaqueba, Random Structures & Algorithms, 67: e70026. [arXiv]
2025, “A note on inverting the dijoin of oriented graphs”, with Tom Johnston, Natasha Morrison and Shannon Ogden, Electronic Journal of Combinatorics 32.1, Paper 1.44. [arXiv]
2025, “An approximate counting version of the Multidimensional Szemerédi Theorem”, with Joseph Hyde, Natasha Morrison, Jonathan A. Noel and Ashna Wright, Combinatorica 45, 42 . [arXiv]
2025, “Common pairs of graphs”, with Natasha Morrison and Jonathan A. Noel, Combinatorics Probability And Computing. [arXiv]
2024, “Improved bounds for cross-Sperner systems“, with Akina Kuperus, Natasha Morrison and Ashna Wright, Electronic Journal of Combinatorics 31.2, Paper 2.4. [arXiv]
2024, “Layered subgraphs of the hypercube”, with Imre Leader, Natasha Morrison and Kada Williams, Electronic Journal of Combinatorics 31.4, Paper 4.21 [arXiv]
2024, “Off-diagonal commonality of graphs via entropy”, with Natasha Morrison and Jonathan A. Noel, SIAM Journal on Discrete Mathematics 38.3, 2335–2360, [arXiv]
2024, “Subgraph games in the semi-random graph process and its generalization to hypergraphs”, with Paweł Prałat, Trent Marbacht and Andrzej Ruciński, Electronic Journal of Combinatorics 31.3, Paper 3.30. [arXiv]
2024, “The rainbow saturation number is linear”, with Tom Johnston, Shoham Letzter, Natasha Morrison and Shannon Ogden, SIAM Journal on Discrete Mathematics 38.2, pp. 1239-1249. [arXiv]
2024, “Thresholds for constrained Ramsey and anti-Ramsey problems”, with Robert Hancock, Joseph Hyde, Shoham Letzter and Natasha Morrison, European Journal of Combinatorics, 104159. [arXiv]
2023, “The iterated local transitivity model for hypergraphs”, with Anthony Bonato, Melissa A. Huggan, Rehan Malik, and Trent G. Marbach, Discrete Applied Mathematics 337, pp. 106-119. [arXiv]
2022, “Synchronizing times for k-sets in automata”, with Robert Johnson. Electronic Journal of Combinatorics 29.3, Paper 3.41. [arXiv]
2022, “The localization capture time of a graph”, with Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, and Brittany Pittman, Theoretical Computer Science 911, pp.80-91. [arXiv]
2022, “Tight bounds on probabilistic zero forcing on hypercubes and grids”, with Paweł Prałat and Trent G. Marbach, Electronic Journal of Combinatorics 29.1, Paper 1.3. [arXiv]
2019, “Semi-perfect 1-factorizations of the hypercube”, Discrete Mathematics 342.6, pp. 1696-1702. [arXiv]
2018, “Hypergraph saturation irregularities”, Electronic Journal of Combinatorics 25.2, Paper 2.11. [arXiv]
Submitted
“A proof of the Kim-Vu sandwich conjecture“, with Richard Montgomery and Daniel Iľkovič.
“Nearly all known Euclidean Ramsey sets are subsoluble“.
“Colour-biased Hamilton cycles in dense graphs and random graphs”, with Debsoumya Chakraborti and Jared León.
“A case of the dijoin conjecture on inverting oriented graphs”, with Patrick Gaudart-Wifling.
“Creating Subgraphs in Semi-Random Hypergraph Games”, with Paweł Prałat and Andrzej Ruciński.
“Sabotage the Mantel Theorem”, with Debsoumya Chakraborti and Xizhi Liu.