معرفی
Richard Montgomery is an Associate Professor (Reader) at the School of Mathematics, University of Warwick, specializing in Extremal and Probabilistic Combinatorics. He holds an ERC Starting Grant for research on spanning subgraphs in graphs. His academic journey includes a PhD from the University of Cambridge (2015), supervised by Andrew Thomason, and postdoctoral roles at Trinity College, Cambridge, and the University of Birmingham.
Research interests focus on combinatorial structures like graphs, hypergraphs, and their probabilistic properties. Key awards include the EMS Prize (2024), Philip Leverhulme Prize (2020), and European Prize in Combinatorics (2019). He currently supervises PhD students Jun Yan, Daniel Iľkovič (jointly with Daniel Kráľ), and Teo Petrov, while mentoring postdoctoral researchers Debsoumya Chakraborti and Natalie Behague.
Montgomery's work bridges theoretical combinatorics with applications, publishing extensively in top journals (e.g., Journal of the London Mathematical Society, Geometric and Functional Analysis). His recent research explores Ramsey theory, extremal graph conjectures, and random graph properties. He organizes the Warwick Combinatorics Seminar and has delivered keynote lectures globally, including at the British Combinatorics Conference and European Congress of Mathematics.
- Grants: ERC Starting Grant (2020), Birmingham Fellowship (2018–2020)
- Labs/Teams: Leads combinatorics research group at Warwick, collaborates internationally on graph theory projects
