With N. Sanhueza-Matamala,
Blowing up Dirac's theorem,
preprint (2024), 13 pages.
With N. Sanhueza-Matamala,
A hypergraph bandwidth theorem,
preprint (2024), 45 pages.
With S. Boyadzhiyska, A. Lo and M. Molloy
Simultaneous edge-colourings,
preprint (2024), 14 pages.
With H. Hàn, J. Pedro Marciano, M. Pavez-Signé, N. Sanhueza-Matamala, A. Treglown and C. Zárate-Guerén,
Colour-bias perfect matchings in hypergraphs,
preprint (2024), 20 pages.
With F. Illingworth, A. Müyesser, O. Parczyk and A. Sgueglia,
Spanning spheres in Dirac hypergraphs,
preprint (2024), 20 pages.
With M. Schacht and J. Volec,
Tight Hamiltonicity from dense links of triples,
preprint (2024), 17 pages.
With F. Joos and N. Sanhueza-Matamala,
Robust Hamiltonicity,
preprint (2023), 30 pages.
With J. D. Alvarado, Y. Kohayakawa, G. O. Mota and H. Stagni,
Resilience for Loose Hamilton Cycles,
preprint (2023), 33 pages.
Tiling dense hypergraphs,
preprint (2023), 35 pages.
With E. Hurley and F. Joos,
Sufficient conditions for perfect mixed tilings,
Journal of Combinatorial Theory, Series B (2024), 60 pages.
With M. Bonamy, M. Delcourt and L. Postle,
Edge-colouring graphs with local list sizes
Journal of Combinatorial Theory, Series B (2024), 28 pages.
With N. Sanhueza-Matamala,
On sufficient conditions for spanning structures in dense graphs,
Proceedings of the London Mathematical Society (2023), 83 pages.
With L. Postle,
An Improved Bound for the Linear Arboricity Conjecture,
Combinatorica (2023), 22 pages.
With P. Allen, J. Böttcher, J. Skokan and M. Stein,
Partitioning a 2-edge-coloured graph of minimum degree 2n/3 + o(n) into three monochromatic cycles,
European Journal of Combinatorics (2023), 30 pages.
With N. Sanhueza-Matamala,
Minimum degree conditions for tight Hamilton cycles,
Journal of the London Mathematical Society (2022), 75 pages.
With C. Hoppen, Y. Kohayakawa, H. Lefmann and H. Stagni,
On the query complexity of estimating the distance to hereditary graph properties,
SIAM Journal on Discrete Mathematics (2021), 15 pages.
With D. Korándi, S. Letzter and A. Pokrovskiy,
Minimum degree conditions for monochromatic cycle partitioning,
Journal of Combinatorial Theory, Series B (2021), 27 pages.
With A. Lo,
Monochromatic cycle partitions in random graphs,
Combinatorics, Probability and Computing (2020), 16 pages.
With C. Hoppen, Y. Kohayakawa, H. Lefmann and H. Stagni,
Estimating parameters associated with monotone properties,
Combinatorics, Probability and Computing (2020), 16 pages.
With J. Corsten, L. DeBiasio and A. Lamaison,
Upper density of monochromatic infinite paths,
Advances in Combinatorics (2019), 16 pages.
With H. Bruhn and L. Gellert,
Chromatic index, treewidth and maximum degree,
Electronic Journal of Combinatorics (2018), 14 pages.
With O. Schaudt and M. Stein,
Almost partitioning a 3-edge-coloured K_{n,n} into 5 monochromatic cycles,
SIAM Journal of Discrete Mathematics (2017), 28 pages.
With M. Stein,
Local colourings and monochromatic partitions in complete bipartite graphs,
European Journal of Combinatorics (2017), 12 pages.
With H. Bruhn and M. Stein,
List edge-colouring and total colouring in graphs of low treewidth,
Journal of Graph Theory (2018), 10 pages.
A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3,
Graphs and Combinatorics (2015), 10 pages.
On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7,
preprint (2015), 25 pages.