Logarithmically small minors and topological minors. - Richard Montgomery 001 (J. Lond. Math. Soc., 2015)

Almost All Friendly Matrices Have Many Obstructions. - Richard Montgomery 001 (SIAM J. Discret. Math., 2015)

Fractional Clique Decompositions of Dense Partite Graphs. - Richard Montgomery 001 (Comb. Probab. Comput., 2017)

Embedding spanning bounded degree subgraphs in randomly perturbed graphs. - Julia Böttcher; Richard Montgomery 001; Olaf Parczyk; Yury Person (Electron. Notes Discret. Math., 2017)

Fractional clique decompositions of dense graphs and hypergraphs. - Ben Barber; Daniela Kühn; Allan Lo; Richard Montgomery 001; Deryk Osthus (J. Comb. Theory B, 2017)

A proof of Mader's conjecture on large clique subdivisions in C4-free graphs. - Hong Liu 010; Richard Montgomery 001 (J. Lond. Math. Soc., 2017)

Rainbow spanning trees in properly coloured complete graphs. - József Balogh; Hong Liu 010; Richard Montgomery 001 (Discret. Appl. Math., 2018)

Forcing large tight components in 3-graphs. - Agelos Georgakopoulos; John Haslegrave; Richard Montgomery 001 (Eur. J. Comb., 2019)

On the decomposition threshold of a given graph. - Stefan Glock; Daniela Kühn; Allan Lo; Richard Montgomery 001; Deryk Osthus (J. Comb. Theory B, 2019)

Hamiltonicity in random graphs is born resilient. - Richard Montgomery 001 (J. Comb. Theory B, 2019)

Universality for bounded degree spanning trees in randomly perturbed graphs. - Julia Böttcher; Jie Han 002; Yoshiharu Kohayakawa; Richard Montgomery 001; Olaf Parczyk; Yury Person (Random Struct. Algorithms, 2019)

Fractional clique decompositions of dense graphs. - Richard Montgomery 001 (Random Struct. Algorithms, 2019)

Hamiltonicity in random directed graphs is born resilient. - Richard Montgomery 001 (Comb. Probab. Comput., 2020)

Minimalist designs. - Ben Barber; Stefan Glock; Daniela Kühn; Allan Lo; Richard Montgomery 001; Deryk Osthus (Random Struct. Algorithms, 2020)

Decompositions into isomorphic rainbow spanning trees. - Stefan Glock; Daniela Kühn; Richard Montgomery 001; Deryk Osthus (J. Comb. Theory B, 2021)

Trees with few leaves in tournaments. - Alistair Benford; Richard Montgomery 001 (J. Comb. Theory B, 2022)

Spanning trees in dense directed graphs. - Amarja Kathapurkar; Richard Montgomery 001 (J. Comb. Theory B, 2022)

Towards the Erdős-Gallai Cycle Decomposition Conjecture. - Matija Bucic; Richard Montgomery 001 (STOC, 2023)

Counting spanning subgraphs in dense hypergraphs. - Richard Montgomery 001; Matías Pavez-Signé (Comb. Probab. Comput., 2024)

Spanning cycles in random directed graphs. - Richard Montgomery 001 (Random Struct. Algorithms, 2024)

Trees with many leaves in tournaments. - Alistair Benford; Richard Montgomery 001 (J. Comb. Theory B, 2025)

Ramsey numbers of bounded degree trees versus general graphs. - Richard Montgomery 001; Matías Pavez-Signé; Jun Yan (J. Comb. Theory B, 2025)