Richard Montgomery

From MaRDI portal
(Redirected from Person:1671317)
Richard Montgomery Q1671317



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Trees with many leaves in tournaments
Journal of Combinatorial Theory. Series B
2024-12-12Paper
Spanning cycles in random directed graphs
Random Structures & Algorithms
2024-10-24Paper
Four open questions for the \(N\)-body problem2024-08-28Paper
Towards the Erdős-Gallai cycle decomposition conjecture2024-05-08Paper
The Kepler Cone, Maclaurin Duality and Jacobi-Maupertuis metrics2023-12-13Paper
A proof of the Ryser-Brualdi-Stein conjecture for large even $n$2023-10-30Paper
Counting spanning subgraphs in dense hypergraphs2023-08-14Paper
\(C_4\)-free subgraphs with large average degree
Israel Journal of Mathematics
2022-04-25Paper
Spanning surfaces in \(3\)-graphs
Journal of the European Mathematical Society (JEMS)
2022-03-29Paper
A proof of Ringel's conjecture
Geometric and Functional Analysis. GAFA
2021-10-04Paper
Decompositions into isomorphic rainbow spanning trees
Journal of Combinatorial Theory. Series B
2021-02-03Paper
Embedding rainbow trees with applications to graph labelling and decomposition
Journal of the European Mathematical Society (JEMS)
2020-12-17Paper
Minimalist designs
Random Structures & Algorithms
2020-09-16Paper
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Mathematika
2020-06-09Paper
Universality for bounded degree spanning trees in randomly perturbed graphs
Random Structures & Algorithms
2020-02-14Paper
Decompositions into spanning rainbow structures
Proceedings of the London Mathematical Society
2019-11-28Paper
Decompositions into spanning rainbow structures
Proceedings of the London Mathematical Society
2019-11-28Paper
On the decomposition threshold of a given graph
Journal of Combinatorial Theory. Series B
2019-11-21Paper
Hamiltonicity in random graphs is born resilient
Journal of Combinatorial Theory. Series B
2019-11-21Paper
Spanning trees in random graphs
Advances in Mathematics
2019-10-10Paper
Fractional clique decompositions of dense graphs
Random Structures & Algorithms
2019-08-14Paper
Fractional clique decompositions of dense graphs
Random Structures & Algorithms
2019-08-14Paper
Forcing large tight components in 3-graphs
European Journal of Combinatorics
2019-01-29Paper
Rainbow spanning trees in properly coloured complete graphs
Discrete Applied Mathematics
2018-09-06Paper
Embedding rainbow trees with applications to graph labelling and decomposition
(available as arXiv preprint)
2018-03-08Paper
Embedding spanning bounded degree subgraphs in randomly perturbed graphs2018-01-18Paper
Embedding spanning bounded degree subgraphs in randomly perturbed graphs
(available as arXiv preprint)
2018-01-18Paper
Fractional clique decompositions of dense partite graphs
Combinatorics, Probability and Computing
2017-10-27Paper
Fractional clique decompositions of dense graphs and hypergraphs
Journal of Combinatorial Theory. Series B
2017-09-29Paper
A proof of Mader's conjecture on large clique subdivisions in \(C_4\)-free graphs
Journal of the London Mathematical Society
2017-09-15Paper
Almost all friendly matrices have many obstructions
SIAM Journal on Discrete Mathematics
2015-05-20Paper
Logarithmically small minors and topological minors
Journal of the London Mathematical Society
2015-02-19Paper
Logarithmically small minors and topological minors
Journal of the London Mathematical Society
2015-02-19Paper
The only syzygy-free solution is Lagrange's2006-01-11Paper
Global rigidity of random graphs in $\mathbb{R}$
(available as arXiv preprint)
N/APaper
Hamiltonicity of expanders: optimal bounds and applications
(available as arXiv preprint)
N/APaper
The Honest Embedding Dimension of a Numerical Semigroup
(available as arXiv preprint)
N/APaper
Packing the largest trees in the tree packing conjecture
(available as arXiv preprint)
N/APaper
Edge-disjoint cycles with the same vertex set
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Richard Montgomery