Richard Montgomery

Affiliations:

University of Warwick, Coventry, UK
University of Birmingham, School of Mathematics, UK (former)
University of Cambridge, UK (former)

According to our database¹, Richard Montgomery authored at least 19 papers between 2015 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Trees with many leaves in tournaments.

[BibT_eX]

[DOI]

Alistair Benford

Richard Montgomery

J. Comb. Theory B, 2025

2023

Towards the Erdős-Gallai Cycle Decomposition Conjecture.

[BibT_eX]

[DOI]

Matija Bucic

Richard Montgomery

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Spanning trees in dense directed graphs.

[BibT_eX]

[DOI]

Amarja Kathapurkar

Richard Montgomery

J. Comb. Theory B, 2022

Trees with few leaves in tournaments.

[BibT_eX]

[DOI]

Alistair Benford

Richard Montgomery

J. Comb. Theory B, 2022

2021

Decompositions into isomorphic rainbow spanning trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

2020

Minimalist designs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Hamiltonicity in random directed graphs is born resilient.

[BibT_eX]

[DOI]

Richard Montgomery

Comb. Probab. Comput., 2020

2019

Fractional clique decompositions of dense graphs.

[BibT_eX]

[DOI]

Richard Montgomery

Random Struct. Algorithms, 2019

Universality for bounded degree spanning trees in randomly perturbed graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Hamiltonicity in random graphs is born resilient.

[BibT_eX]

[DOI]

Richard Montgomery

J. Comb. Theory B, 2019

On the decomposition threshold of a given graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Forcing large tight components in 3-graphs.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

John Haslegrave

Richard Montgomery

Eur. J. Comb., 2019

2018

Rainbow spanning trees in properly coloured complete graphs.

[BibT_eX]

[DOI]

József Balogh

Hong Liu

Richard Montgomery

Discret. Appl. Math., 2018

2017

A proof of Mader's conjecture on large clique subdivisions in C4-free graphs.

[BibT_eX]

[DOI]

Hong Liu

Richard Montgomery

J. Lond. Math. Soc., 2017

Fractional clique decompositions of dense graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Embedding spanning bounded degree subgraphs in randomly perturbed graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Fractional Clique Decompositions of Dense Partite Graphs.

[BibT_eX]

[DOI]

Richard Montgomery

Comb. Probab. Comput., 2017

2015

Almost All Friendly Matrices Have Many Obstructions.

[BibT_eX]

[DOI]

Richard Montgomery

SIAM J. Discret. Math., 2015

Logarithmically small minors and topological minors.

[BibT_eX]

[DOI]

Richard Montgomery

J. Lond. Math. Soc., 2015

Richard Montgomery

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...