Richard Montgomery

Papers and preprints Teaching CV

  1. Embedding rainbow trees with applications to graph labelling and decomposition
    With Alexey Pokrovskiy and Benny Sudakov

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

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

  4. Forcing large tight components in 3-graphs
    With Agelos Georgakopoulos and John Haslegrave

  5. Fractional clique decompositions of dense graphs

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

  7. Hamiltonicity in random graphs is born resilient

  8. Spanning trees in random graphs

  9. On the decomposition threshold of a given graph
    With Stefan Glock, Daniela Kühn, Allan Lo and Deryk Osthus

  10. 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

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

  12. 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

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

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