Richard Montgomery
Papers and preprints Teaching CV
  1. Edge-disjoint cycles with the same vertex set
    With Debsoumya Chakraborti, Oliver Janzer and Abhishek Methuku

  2. Packing the largest trees in the tree packing conjecture
    With Barnabás Janzer

  3. Hamiltonicity of expanders: optimal bounds and applications
    With Nemanja Draganić, David Munhá Correia, Alexey Pokrovskiy and Benny Sudakov

  4. Global rigidity of random graphs in R
    With Rajko Nenadov and Tibor Szabó

  5. Ramsey goodness of bounded-degree trees
    With Jun Yan and Matías Pavez-Signé

  6. A proof of the Ryser-Brualdi-Stein conjecture for large even n

  7. Counting spanning subgraphs in dense hypergraphs
    With Matías Pavez-Signé
    Combinatorics, Probability and Computing, to appear

  8. Towards the Erdős-Gallai Cycle Decomposition Conjecture
    With Matija Bucić
    Advances in Mathematics, 2024 (and STOC, 2023)

  9. Trees with many leaves in tournaments
    With Alistair Benford

  10. Transversal factors and spanning trees
    With Alp Müyesser and Yani Pehova
    Advances in Combinatorics, 2022

  11. Trees with few leaves in tournaments
    With Alistair Benford
    Journal of Combinatorial Theory, Series B, 2022

  12. Spanning cycles in random directed graphs
    Random Structures & Algorithms, to appear

  13. Spanning trees in dense directed graphs
    With Amarja Kathapurkar
    Journal of Combinatorial Theory, Series B, 2022

  14. A solution to Erdős and Hajnal's odd cycle problem
    With Hong Liu
    Journal of the American Mathematical Society, 2023.

  15. C4-free subgraphs with large average degree
    With Alexey Pokrovskiy and Benny Sudakov
    Israel Journal of Mathematics, 2021.

  16. A proof of Ringel's Conjecture
    With Alexey Pokrovskiy and Benny Sudakov
    Geometric and Functional Analysis, 2021

  17. Decompositions into isomorphic rainbow spanning trees
    With Stefan Glock, Daniela Kühn, and Deryk Osthus
    Journal of Combinatorial Theory, Series B, 2021

  18. Hamiltonicity in random directed graphs is born resilient
    Combinatorics, Probability and Computing, 2020

  19. Minimalist designs
    With Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo and Deryk Osthus
    Random Structures and Algorithms, 2020

  20. Spanning surfaces in 3-graphs
    With Agelos Georgakopoulos, John Haslegrave and Bhargav Narayanan
    Journal of the European Mathematical Society, 2021

  21. Decompositions into spanning rainbow structures
    With Alexey Pokrovskiy and Benny Sudakov
    Proceedings of the LMS, 2019

  22. Embedding rainbow trees with applications to graph labelling and decomposition
    With Alexey Pokrovskiy and Benny Sudakov
    Journal of the European Mathematical Society, 2020

  23. Universality for bounded degree spanning trees in randomly perturbed graphs
    With Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Olaf Parczyk and Yury Person
    Random Structures and Algorithms, 2019

  24. Embedding spanning bounded degree graphs in randomly perturbed graphs
    With Julia Böttcher, Olaf Parczyk and Yury Person
    Mathematika, 2020

  25. Forcing large tight components in 3-graphs
    With Agelos Georgakopoulos and John Haslegrave
    European Journal of Combinatorics, 2019

  26. Fractional clique decompositions of dense graphs
    Random Structures and Algorithms, 2018

  27. Rainbow spanning trees in properly coloured complete graphs
    With Jósef Balogh and Hong Liu
    Discrete Applied Mathematics, 2018

  28. Hamiltonicity in random graphs is born resilient
    Journal of Combinatorial Theory, Series B, 2019

  29. Spanning trees in random graphs
    Advances in Mathematics, 2019

  30. On the decomposition threshold of a given graph
    With Stefan Glock, Daniela Kühn, Allan Lo and Deryk Osthus
    Journal of Combinatorial Theory, Series B, 2019

  31. Fractional clique decompositions of dense graphs and hypergraphs
    With Ben Barber, Daniela Kühn, Allan Lo and Deryk Osthus
    Journal of Combinatorial Theory, Series B, 2017

  32. Fractional clique decompositions of partite graphs
    Combinatorics, Probability and Computing, 2017

  33. A proof of Mader's conjecture on large clique subdivisions in C_4-free graphs
    With Hong Liu
    Journal of the London Mathematical Society, 2017

  34. Almost all friendly matrices have many obstructions
    SIAM Journal on Discrete Mathematics, 2015

  35. Logarithmically-small minors and topological minors
    Journal of the London Mathematical Society, 2014