Richard Montgomery

Papers and preprints CV

  1. Rainbow spanning trees in properly coloured complete graphs
    With Jósef Balogh and Hong Liu

  2. Hamiltonicity in random graphs is born resilient

  3. Spanning trees in random graphs

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

  5. 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, to appear

  6. Fractional clique decompositions of partite graphs
    Combinatorics, Probability and Computing, to appear

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

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

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