 | Review waiting, please be patient.
This may take 3 months or more, since drafts are reviewed in no specific order. There are 5,186 pending submissions waiting for review.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Reviewer tools
|
Comment: The title of this draft either has been disambiguated or will need to be disambiguated for acceptance.If the title of this draft has been disambiguated, submitters and reviewers are asked to check the disambiguated title to see if it is the most useful disambiguation, and, if necessary, rename this draft. If this draft is accepted, the disambiguation page will need to be edited. Either an entry will need to be added, or an entry will need to be revised. Please do not edit the disambiguation page or insert a link to this draft unless you are accepting this draft.The disambiguation page for the primary name is Richard Montgomery (disambiguation).You may ask for advice about disambiguation at the Teahouse. Robert McClenon (talk) 19:51, 27 May 2026 (UTC)
Richard Montgomery | |
|---|---|
| Born | 28 January 1990 |
| Alma mater | University of Cambridge |
| Awards | Adams Prize (2026) Whitehead Prize (2025) EMS Prize (2024) Philip Leverhulme Prize (2020) European Prize in Combinatorics (2019) |
| Scientific career | |
| Fields | Mathematics |
| Institutions | University of Warwick |
| Andrew Thomason | |
| Website | rhmontgomery |
Richard Montgomery (born 28 January 1990) is a mathematician specialising in extremal combinatorics, probabilistic combinatorics and graph theory. He is a professor of mathematics at the University of Warwick.
Education and career
editMontgomery studied mathematics at the University of Cambridge, receiving a BA and MMath before completing a PhD in 2015 under the supervision of Andrew Thomason.[1]
After his PhD, Montgomery was a postdoctoral fellow at the University of Birmingham in 2015 and a Junior Research Fellow at Trinity College, Cambridge, from 2015 to 2019. He later held further positions at the University of Birmingham before joining the University of Warwick in 2022, where he became a professor in 2025.[2]
Research
editMontgomery works in extremal and probabilistic combinatorics, especially graph embedding and graph decomposition problems. In 2019, he proved a result on spanning trees in random graphs, confirming a conjecture of Jeff Kahn on the threshold for embedding every bounded-degree spanning tree.[3]
With Alexey Pokrovskiy and Benny Sudakov, Montgomery proved Ringel's conjecture for sufficiently large complete graphs. The conjecture, posed by Ringel in 1963, concerns decompositions of complete graphs into copies of a given tree.[4]
Montgomery has also worked on cycle lengths in graphs. With Hong Liu, he solved a problem of Paul Erdős and András Hajnal on odd cycle lengths in graphs of large chromatic number.[5]
With Matija Bucić, he made progress on the Erdős–Gallai cycle decomposition conjecture.[6]
In work on Latin squares and transversals, Montgomery proved that every sufficiently large Latin square has a transversal of size one less than its order, resolving the large even-order case of the Ryser–Brualdi–Stein conjecture.[7]
Awards and honours
editMontgomery was awarded the European Prize in Combinatorics in 2019 jointly with Alexey Pokrovskiy.[8]
In 2020, he received a Philip Leverhulme Prize in Mathematics and Statistics.[9]
His research has been supported by a European Research Council Starting Grant.[10]
In 2024, he received an EMS Prize for work including his contributions to extremal combinatorics, graph decompositions, and cycle structure in sparse graphs.[11]
In 2025, he received a Whitehead Prize from the London Mathematical Society for his work on the absorption method and related problems in extremal and probabilistic combinatorics.[12]
Montgomery was jointly awarded the 2025–26 Adams Prize with Julian Sahasrabudhe.[13]
He was selected as an invited section speaker for the 2026 International Congress of Mathematicians.[14]
Selected publications
edit- Montgomery, Richard (2019). "Spanning trees in random graphs". Advances in Mathematics. 356: 106793. doi:10.1016/j.aim.2019.106793.
{{cite journal}}: CS1 maint: article number as page number (link) - Montgomery, Richard; Pokrovskiy, Alexey; Sudakov, Benny (2021). "A proof of Ringel's conjecture". Geometric and Functional Analysis. 31 (3): 663–720. doi:10.1007/s00039-021-00576-2.
- Liu, Hong; Montgomery, Richard (2023). "A solution to Erdős and Hajnal's odd cycle problem". Journal of the American Mathematical Society. 36 (4): 1191–1234. doi:10.1090/jams/1018.
- Bucić, Matija; Montgomery, Richard (2024). "Towards the Erdős–Gallai cycle decomposition conjecture". Advances in Mathematics. 437: 109434. doi:10.1016/j.aim.2023.109434.
{{cite journal}}: CS1 maint: article number as page number (link)
External links
edit- Official website
- Richard Montgomery at the University of Warwick
- Richard Montgomery at the Mathematics Genealogy Project
- ↑ "Richard Montgomery". Mathematics Genealogy Project. Retrieved 4 May 2026.
- ↑ "Five Warwick Maths Professors invited to speak at world-renowned ICM". University of Warwick. 22 July 2025. Retrieved 12 May 2026.
- ↑ Montgomery, Richard (2019). "Spanning trees in random graphs". Advances in Mathematics. 356: 106793. doi:10.1016/j.aim.2019.106793.
{{cite journal}}: CS1 maint: article number as page number (link) - ↑ Montgomery, Richard; Pokrovskiy, Alexey; Sudakov, Benny (2021). "A proof of Ringel's conjecture". Geometric and Functional Analysis. 31 (3): 663–720. doi:10.1007/s00039-021-00576-2.
- ↑ Liu, Hong; Montgomery, Richard (2023). "A solution to Erdős and Hajnal's odd cycle problem". Journal of the American Mathematical Society. 36 (4): 1191–1234. doi:10.1090/jams/1018.
- ↑ Bucić, Matija; Montgomery, Richard (2024). "Towards the Erdős–Gallai cycle decomposition conjecture". Advances in Mathematics. 437: 109434. doi:10.1016/j.aim.2023.109434.
{{cite journal}}: CS1 maint: article number as page number (link) - ↑ "Adams Prize Winner 2025–26". University of Cambridge Faculty of Mathematics. Retrieved 4 May 2026.
- ↑ "Birmingham Researcher Receives European Prize in Combinatorics". University of Birmingham. 8 October 2019. Retrieved 4 May 2026.
- ↑ "Philip Leverhulme Prizes 2020". The Leverhulme Trust. Retrieved 4 May 2026.
- ↑ "Spanning Subgraphs in Graphs". CORDIS, European Commission. Retrieved 4 May 2026.
- ↑ "Fourteen prizes awarded to European mathematicians at the 9th ECM". European Mathematical Society. 15 July 2024. Retrieved 4 May 2026.
- ↑ "LMS Prize Winners 2025". London Mathematical Society. 4 July 2025. Retrieved 4 May 2026.
- ↑ "Adams Prize Winner 2025–26". University of Cambridge Faculty of Mathematics. Retrieved 4 May 2026.
- ↑ "Five Warwick Maths Professors invited to speak at world-renowned ICM". University of Warwick. 22 July 2025. Retrieved 12 May 2026.