• A rainbow blow-up lemma (with S. Glock, to appear in Random Structures Algorithms).
• Edge correlations in random regular hypergraphs and applications to subgraph testing (with A. Espuny Diaz, D. Kühn, and D. Osthus, to appear in SIAM J. Discrete Math.).
• Spanning trees in randomly perturbed graphs (with J. Kim, to appear in Random Structures Algorithms).
• Optimal packings of bounded degree trees (with J. Kim, D. Kühn, and D. Osthus, to appear in J. Eur. Math. Soc.).

Published articles:

2019

• A unified theorem for packing disjoint cycles under constraints via doubly group-labeled graphs (with T. Huynh and P. Wollan, Combinatorica 39 (2019), 91-133).
• Long cycles have the edge-Erdős-Pósa property (with H. Bruhn and M. Heinlein, Combinatorica 39 (2019), 1-36).
• On the hard sphere model and sphere packings in high dimensions (with M. Jenssen and W. Perkins, Forum Math. Sigma 7 (2019), 19p.).

2018

• On kissing numbers and spherical codes in high dimesions (with M. Jenssen and W. Perkins, Adv. Math. 335 (2018), 307-321).
• Critical percolation on random regular graphs (with G. Perarnau, Proc. Amer. Math. Soc. 146 (2018), 3321-3332.).
• Frames, A-paths and the Erdős-Pósa property (with H. Bruhn and M. Heinlein, SIAM J. Discrete Math. 32 (2018), 1246-1260).
• Long paths and cycles in random subgraphs of graphs with large minimum degree (with S. Ehard, Electron. J. Combin. 25 (2018), no. 2, Paper 31, 15 pp).
• Long cycles through prescribed vertices have the Erdos-Posa property (with H. Bruhn and O. Schaudt, J. Graph Theory 87 (2018), 275-284).
• How to determine if a random graph with a fixed degree sequence has a giant component (with G. Perarnau, D. Rautenbach and B. Reed, Probab. Theory Related Fields 170 (2018), 263-310, extended abstract: FOCS 2016, 695-703).
• A stronger bound for the strong chromatic index (with H. Bruhn, Combin. Probab. Comput. 27 (2018), 21-43).

2017

• Parity linkage and the Erdos-Posa property of odd cycles through prescribed vertices in highly connected graphs (J. Graph Theory 85 (2017), 747-758).

2016