1. Seymour's second neighbourhood conjecture: random graphs and reductions (with A. Espuny Díaz, B. Granet and, G. Kronenberg, submitted)

2. Non homotopic drawings of multigraphs (with F. Illingworth, A. Scott and D. Wood, submitted) 

3. Ordered Ramsey numbers of powers of paths (with B. Janzer and, O. Janzer, submitted)  

4. Induced subdivisions in K_{s,s}-free graphs with polynomial average degree (with Z. Hunter, submitted)

5. Abundance: Asymmetric graph removal lemmas and integer solution to linear equations (with E. Hurley, F. Illingworth and, L. Michel, To appear in J. London Math. Soc.) 

6. Induced C_4-free subgraph with high average degree (with X. Du, Z. Hunter, R. McCarty, and A. Scott, submitted)

7. Chromatic number is not tournament-local (with K. Hendrey, F. Illingworth, F. Lehner, L. Michel, M. Savery and, R. Steiner, To appear in J. Combin. Theory, Series B) 

8. Flashes and rainbows in tournaments (with F. Illingworth, L. Michel, M. Savery and, A. Scott, To appear in Combinatorica) 

9. A note on the interval colouring thickness of graphs (with M. Axenovich, L. Hollom, J. Portier, E. Powierski, M. Savery, Y. Tamitegama, L. Versteegen, To appear in European J. Combin. )

10. Immersions of directed graphs in tournaments (with R. Hancock, submitted)

11. Reconstructing a point set from a random subset of its pairwise distances (with F. Illingworth, L. Michel, A. Scott and E. Powierski, submitted)

12. A note on unavoidable patterns in locally dense colourings (with D. Munhá Correia, To appear in Combin. Probab. Comput.)

13. Partitioning a tournament into sub-tournaments of high connectivity (with S. Letzter, To appear in Combinatorica) 

14. A multidimensional Ramsey Theorem (with G. Kronenberg, and A. Scott, submitted) 

15. Defective colourings of hypergraphs (with F. Illingworth,  A. Scott and, D. Wood, To appear in Random Struct. Algorithms)

16. Two Ramsey problems in blowups of graphs (with R. Hancock, To appear in European J. Combin.) 

17. Induced subgraphs of induced subgraphs of large chromatic number (with F. Illingworth, E. Powiersky, M. Savery, A. Scott, Y. Tamitegama, and J. Tan, To appear in Combinatorica) 

18. Tiling with monochromatic bipartite subgraphs of bounded maximum degree (with O. Janzer, submitted)

19. Immersions of complete digraphs in eulerian digraphs (with S. Letzter, To appear in  Israel J. Mathematics)

20. Powers of paths and cycles in tournaments (with D. Korándi and A. Scott, To appear in Combin. theory) 

21. Path decompositions of tournaments (with B. Granet, D. Kühn, A. Lo, and D. Osthus, Proc. London Math. Soc. 126 (2023), no. 2, 429–517) 

22. Hamiltonicity of graphs perturbed by random regular graphs (with  A. Espuny Díaz, Random Struct. Algorithms 62 (2023), 857–886.) 

23. New stepping-up constructions for multicoloured hypergraphs (with Q. Dubroff, E. Hurley, C. Yap, Forum Mathematics, Sigma (2023) 11, E84.)

24. A canonical polynomial Van der Waerden's Theorem (submitted)

25. Hamiltonicity of random subgraphs of the hypercube (with P. Condon, A. Espuny Díaz, D. Kühn, and D. Osthus, To appear in Memoirs of AMS) 

26. Strong complete minors in tournaments (with M. Axenovich, R. Snyder, and L. Weber, Combin. Probab. and Comput. 31 (2022), no. 3, 489–506)

27. Turán theorems for unavoidable patterns (with B. Narayanan,  Math. Proc. Cambr. Phil. Soc. 172 (2022), no. 2, 423-442)

28. Subgraphs of large connectivity and chromatic number (with B. Narayanan, Bull. Lond. Math. Soc. 54 (2022), no. 3, 868-875) 

29. Path and cycle decomposition of dense graphs (with B. Granet, D. Kühn, and D. Osthus, J. Lond. Math. Soc. 104 (2021), no. 3, 1085-1134) 

30. Powers of paths in tournaments (with N. Draganic, F. Dross, J. Fox, F. Havet, D. Korándi, W. Lochet, D. Correia, A. Scott, and B. Sudakov, Combin. Probab. Comput. 30 (2021), no. 6, 894-898 )

31. (2k+1)-connected tournaments with large minimum out-degree are k-linked (with K. Popielarz, and R. Snyder, Combinatorica 41 (2021), no. 6, 815-837)

32. Hamiltonicity of random subgraphs of the hypercube (with P. Condon,  A. Espuny Díaz, D. Kühn, and D. Osthus, ACM-SIAM Symposium on Discrete Algorithms 2021) 

33. On Covering Numbers, Young Diagrams, and the Local Dimension of Posets (with G. Damásdi, S. Felsner, B. Keszegh, D. Lewis, D. Nágy, T. Ueckerdt,   SIAM J. Discrete. Math. 35 (2021), no. 2, 915 - 927) 

34. Subdivisions of digraphs in tournaments (with K. Popielarz, and R. Snyder, J. Combin. Theory, Series B 146 (2021), 266 – 285)

35. Dirac’s theorem for random regular graphs (with P. Condon, A. Espuny Díaz, D. Kühn, and D. Osthus, Combin. Probab. and Comput. 30 (2021), no. 1, 17 - 36)

36. Rainbow saturation of graphs (with D. Lewis, and K. Popielarz, J. Graph Theory 94 (2020), no. 3, 421 - 444)

37. A large number of m-coloured complete infinite subgraphs (J. Combin. Theory, Series B 142 (2020), 80 – 105)

38. Disjoint pairs in set systems with restricted intersection (with R. Snyder, European J. Combin. 83 (2020), 102998)

39. VC dimension and a union theorem for set systems (S. Cambie, and R. J. Kang, Electron. J. Combin. 26 (2019), no. 3, #P3.24)

40. On the maximum diameter of path-pairable graphs (with G. Mészáros, K. Popielarz, and R. Snyder, Graphs and Combin. 35 (2019), no. 6, 1647 − 1657)

41. Partite Saturation of Complete Graphs (with T. Kittipassorn, and K. Popielarz, SIAM J. Discrete. Math. 33 (2019), no. 4, 2346 − 2359)

42. Partitioning a graph into monochromatic connected subgraphs (with S. Letzter, and J. Sahasrabudhe, J. Graph Theory 91 (2019), no. 4, 353 – 364)

43. Precolouring extension of Vizing’s theorem (with R. J. Kang, J. Graph Theory 92 (2019), no. 3, 255 - 260) 

44. Highly linked tournaments with large minimum out degree (with R. Snyder, J. Combin. Theory, Series B 139 (2019), 251 − 266) 

45. Long cycles in Hamiltonian graphs (with T. Kittipassorn, and B. Narayanan, Israel J. Mathematics 229 (2019), no. 1, 269 − 285)

46. On the maximum degree of path-pairable planar graphs (with G. Mészáros, K. Popielarz, and R. Snyder, Electron. J. Combin. 26 (2019), no. 2,  #P2.18)

47. Large induced subgraphs with k vertices of almost maximum degree (with K. Popielarz, SIAM J. Discrete. Math. 32 (2018), no. 1, 450 − 454)

48. On a conjecture of Gentner and Rautenbach (with G. Mészáros, and S. G. Z. Smith, Discrete. Math. 341 (2018), no. 4, 1094 − 1097)

49. An improved upper bound on the maximum degree of terminal-pairable complete graphs (with G. Mészáros, Discrete. Math. 341 (2018), no. 9, 2606 − 2607)

50. Extension from Precoloured Sets of Edges (with K. Edwards, J. van den Heuvel, R. J. Kang, G. J. Puleo, and J-S. Sereni, Electron. J. Combin. 25 (2018), no. 3, #P3.1)

51. Generalised Majority Colourings of Digraphs (with T. Kittipassorn, and K. Popielarz, Combin., Probab. and Comput. 26 (2017), no. 6, 850 − 855) 

Preprints 

• A note on long powers of paths in tournaments

I had the pleasure to collaborate with: 

T. Kittipassorn, K. Popielarz, R. Snyder, S. Letzter, K. Edwards, J. Van den Heuvel, R. J. Kang, G. J. Puleo, J-S. Sereni, G. Mészáros, S. G. Z. Smith,  B. Narayanan, J. Sahasrabudhe, S. Cambie, D. Lewis, P. Condon, A. Espuny Díaz, D. Kühn, D. Osthus,  B. Granet, N. Draganic, F. Dross, J. Fox, F. Havet, D. Korándi, W. Lochet, D. M. Correia, A. Scott, B. Sudakov,  Q. Dubroff, E. Hurley, C. Yap, G. Damásdi, S. Felsner, B. Keszegh, D. Nágy, T. Ueckerdt, O. Janzer, F. Illingworth, E. Powiersky, M. Savery, Y. Tamitegama, J. Tan,  D. Wood, G. Kronenberg, L. Michel, M. Axenovich, L. Hollom, J. Portier K. Hendrey, F. Lehner, R. Steiner, X. Du, R. McCarty, Z. Hunter, B. Janzer