Alexey Pokrovskiy is a mathematician specialising in combinatorics and graph theory. He is an associate professor in the Department of Mathematics at University College London. He is known for his work in extremal and probabilistic combinatorics, including a proof of Ringel’s conjecture with Richard Montgomery and Benny Sudakov for large graphs, as covered by Quanta magazine. In 2019, he and Montgomery received the European Prize in Combinatorics.
Education and career
Pokrovskiy studied mathematics at the University of Cambridge, receiving a BA in 2008 and an MMath with distinction in 2009. He completed a PhD in mathematics at the London School of Economics in 2013 under the supervision of Jan van den Heuvel and Jozef Skokan.
Pokrovskiy was a postdoctoral researcher at the Free University of Berlin from 2013 to 2015 and at ETH Zurich from 2015 to 2018. He was then a lecturer at Birkbeck, University of London from 2018 to 2020, before joining University College London in 2020.
Research
Pokrovskiy's work is in discrete mathematics, especially extremal and probabilistic combinatorics. His notable results include an approximate version of the Aharoni-Berger conjecture and his work with Matija Bucić, Matthew Kwan and Benny Sudakov on Rota's basis conjecture. His other significant works include a proof with Richard Montgomery and Benny Sudakov of Ringel's conjecture for large graphs and his work with Alp Müyesser giving a random version of the Hall–Paige conjecture.
Awards and honours
In 2019, Pokrovskiy shared the European Prize in Combinatorics with Richard Montgomery. The prize announcement cited their "deep contributions to extremal and probabilistic combinatorics".
Selected publications
External links
Alexey Pokrovskiy at University College London
References