Alexey Pokrovskiy

Alexey Pokrovskiy
Alma materUniversity of Cambridge
London School of Economics
Scientific career
FieldsMathematics
WorkplacesUniversity College London
Jan van den Heuvel
Jozef Skokan

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.[1][2] 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.[3] In 2019, he and Montgomery received the European Prize in Combinatorics.[4][5]

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.[6]

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.[7][8]

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.[9][10] 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.[11][12]

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".[13]

Selected publications

  • Pokrovskiy, Alexey (2015). "A linear bound on the Manickam–Miklós–Singhi conjecture". Journal of Combinatorial Theory. Series A. 133: 280–306. doi:10.1016/j.jcta.2015.01.007.
  • Pokrovskiy, Alexey (2018). "An approximate version of a conjecture of Aharoni and Berger". Advances in Mathematics. 333: 1197–1241. arXiv:1609.06346. doi:10.1016/j.aim.2018.05.036.
  • Bucić, Matija; Kwan, Matthew; Pokrovskiy, Alexey; Sudakov, Benny (2020). "Halfway to Rota's Basis Conjecture". International Mathematics Research Notices. 2020 (21): 8007–8026. arXiv:1810.07462. doi:10.1093/imrn/rnaa004.
  • Montgomery, Richard; Pokrovskiy, Alexey; Sudakov, Benny (2021). "A proof of Ringel's conjecture". Geometric and Functional Analysis. 31 (3): 663–720. arXiv:2001.02665. doi:10.1007/s00039-021-00576-2.
  • Müyesser, Alp; Pokrovskiy, Alexey (2025). "A random Hall-Paige conjecture". Inventiones Mathematicae. 240 (3): 779–867. arXiv:2204.09666. Bibcode:2025InMat.240..779M. doi:10.1007/s00222-025-01328-x.

References

  1. ↑ "Alexey Pokrovskiy". University College London. Retrieved 3 May 2026.
  2. ↑ "Academic and Lecturing Staff". University College London. Retrieved 3 May 2026.
  3. ↑ Hartnett, Kevin (19 February 2020). "Rainbow Proof Shows Graphs Have Uniform Parts". Quanta Magazine. Retrieved 21 July 2026.
  4. ↑ "BEI Research Year in Review | Birkbeck Research Blog". research.blogs.bbk.ac.uk. Retrieved 21 July 2026.
  5. ↑ "Birmingham Researcher Receives European Prize in Combinatorics". University of Birmingham. Retrieved 21 July 2026.
  6. ↑ Pokrovskiy, Alexey (May 2013). Graph powers, partitions, and other extremal problems (doctoral thesis). London School of Economics and Political Science.
  7. ↑ Pokrovskiy, Alexey. "Curriculum vitae" (PDF). Retrieved 3 May 2026.
  8. ↑ "De Morgan Association Newsletter 2019" (PDF). University College London. Retrieved 3 May 2026.
  9. ↑ Pokrovskiy 2018.
  10. ↑ Bucić et al. 2020.
  11. ↑ Montgomery, Pokrovskiy & Sudakov 2021.
  12. ↑ Müyesser & Pokrovskiy 2025.
  13. ↑ "Prestigious accolades and honours" (PDF). Birkbeck International Digest 2019-2020. Birkbeck, University of London: 26–30. Retrieved 17 May 2026.
This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.