Spanning trees in random graphs R Montgomery
Advances in Mathematics 356, 106793, 2019
100 2019 Universality for bounded degree spanning trees in randomly perturbed graphs J Böttcher, J Han, Y Kohayakawa, R Montgomery, O Parczyk, Y Person
Random Structures & Algorithms 55 (4), 854-864, 2019
60 2019 A proof of Ringel’s conjecture R Montgomery, A Pokrovskiy, B Sudakov
Geometric and Functional Analysis 31 (3), 663-720, 2021
58 2021 Embedding bounded degree spanning trees in random graphs R Montgomery
arXiv preprint arXiv:1405.6559, 2014
57 2014 Embedding spanning bounded degree graphs in randomly perturbed graphs J Böttcher, R Montgomery, O Parczyk, Y Person
Mathematika 66 (2), 422-447, 2020
55 2020 Decompositions into spanning rainbow structures R Montgomery, A Pokrovskiy, B Sudakov
Proceedings of the London Mathematical Society 119 (4), 899-959, 2019
41 2019 On the decomposition threshold of a given graph S Glock, D Kühn, A Lo, R Montgomery, D Osthus
Journal of Combinatorial Theory, Series B 139, 47-127, 2019
40 2019 Embedding rainbow trees with applications to graph labelling and decomposition R Montgomery, A Pokrovskiy, B Sudakov
Journal of the European Mathematical Society 22 (10), 3101-3132, 2020
37 2020 A solution to Erdős and Hajnal’s odd cycle problem H Liu, R Montgomery
Journal of the American Mathematical Society 36 (4), 1191-1234, 2023
33 2023 Fractional clique decompositions of dense graphs and hypergraphs B Barber, D Kühn, A Lo, R Montgomery, D Osthus
Journal of Combinatorial Theory, Series B 127, 148-186, 2017
30 2017 Decompositions into isomorphic rainbow spanning trees S Glock, D Kühn, R Montgomery, D Osthus
Journal of Combinatorial Theory, Series B 146, 439-484, 2021
27 2021 Hamiltonicity in random graphs is born resilient R Montgomery
Journal of Combinatorial Theory, Series B 139, 316-341, 2019
27 2019 Fractional clique decompositions of dense partite graphs R Montgomery
Combinatorics, Probability and Computing 26 (6), 911-943, 2017
26 2017 A proof of Mader's conjecture on large clique subdivisions in H Liu, R Montgomery
Journal of the London Mathematical Society 95 (1), 203-222, 2017
26 2017 Minimalist designs B Barber, S Glock, D Kühn, A Lo, R Montgomery, D Osthus
Random Structures & Algorithms 57 (1), 47-63, 2020
24 2020 Transversal factors and spanning trees R Montgomery, A Müyesser, Y Pehova
arXiv preprint arXiv:2107.04629, 2021
22 2021 Rainbow spanning trees in properly coloured complete graphs J Balogh, H Liu, R Montgomery
Discrete Applied Mathematics 247, 97-101, 2018
18 2018 Logarithmically small minors and topological minors R Montgomery
Journal of the London Mathematical Society 91 (1), 71-88, 2015
16 2015 Hamiltonicity in random directed graphs is born resilient R Montgomery
Combinatorics, Probability and Computing 29 (6), 900-942, 2020
13 2020 Spanning trees in dense directed graphs A Kathapurkar, R Montgomery
Journal of Combinatorial Theory, Series B 156, 223-249, 2022
12 2022 