We stand with Ukraine  

Richard Montgomery

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


According to our database1, Richard Montgomery authored at least 18 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Towards the Erdős-Gallai Cycle Decomposition Conjecture.
[BibTeX]
[DOI]
Matija Bucic
,
Richard Montgomery
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Spanning trees in dense directed graphs.
[BibTeX]
[DOI]
Amarja Kathapurkar
,
Richard Montgomery
J. Comb. Theory, Ser. B, 2022

Trees with few leaves in tournaments.
[BibTeX]
[DOI]
Alistair Benford
,
Richard Montgomery
J. Comb. Theory, Ser. B, 2022

2021
Decompositions into isomorphic rainbow spanning trees.
[BibTeX]
[DOI]
Stefan Glock
,
Daniela Kühn
,
Richard Montgomery
,
Deryk Osthus
J. Comb. Theory, Ser. B, 2021

2020
Minimalist designs.
[BibTeX]
[DOI]
Ben Barber
,
Stefan Glock
,
Daniela Kühn
,
Allan Lo
,
Richard Montgomery
,
Deryk Osthus
Random Struct. Algorithms, 2020

Hamiltonicity in random directed graphs is born resilient.
[BibTeX]
[DOI]
Richard Montgomery
Comb. Probab. Comput., 2020

2019
Fractional clique decompositions of dense graphs.
[BibTeX]
[DOI]
Richard Montgomery
Random Struct. Algorithms, 2019

Universality for bounded degree spanning trees in randomly perturbed graphs.
[BibTeX]
[DOI]
Julia Böttcher
,
Jie Han
,
Yoshiharu Kohayakawa
,
Richard Montgomery
,
Olaf Parczyk
,
Yury Person
Random Struct. Algorithms, 2019

Hamiltonicity in random graphs is born resilient.
[BibTeX]
[DOI]
Richard Montgomery
J. Comb. Theory, Ser. B, 2019

On the decomposition threshold of a given graph.
[BibTeX]
[DOI]
Stefan Glock
,
Daniela Kühn
,
Allan Lo
,
Richard Montgomery
,
Deryk Osthus
J. Comb. Theory, Ser. B, 2019

Forcing large tight components in 3-graphs.
[BibTeX]
[DOI]
Agelos Georgakopoulos
,
John Haslegrave
,
Richard Montgomery
Eur. J. Comb., 2019

2018
Rainbow spanning trees in properly coloured complete graphs.
[BibTeX]
[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.
[BibTeX]
[DOI]
Hong Liu
,
Richard Montgomery
J. Lond. Math. Soc., 2017

Fractional clique decompositions of dense graphs and hypergraphs.
[BibTeX]
[DOI]
Ben Barber
,
Daniela Kühn
,
Allan Lo
,
Richard Montgomery
,
Deryk Osthus
J. Comb. Theory, Ser. B, 2017

Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
[BibTeX]
[DOI]
Julia Böttcher
,
Richard Montgomery
,
Olaf Parczyk
,
Yury Person
Electron. Notes Discret. Math., 2017

Fractional Clique Decompositions of Dense Partite Graphs.
[BibTeX]
[DOI]
Richard Montgomery
Comb. Probab. Comput., 2017

2015
Almost All Friendly Matrices Have Many Obstructions.
[BibTeX]
[DOI]
Richard Montgomery
SIAM J. Discret. Math., 2015

Logarithmically small minors and topological minors.
[BibTeX]
[DOI]
Richard Montgomery
J. Lond. Math. Soc., 2015


  Loading...