Alexey Pokrovskiy

Alexey Pokrovskiy is a Lecturer in the Department of Mathematics at University College London (UCL), part of the Faculty of Mathematical and Physical Sciences. His research focuses on Discrete Mathematics and Combinatorics, with particular emphasis on graph theory, Ramsey theory, and positional games. He holds a PhD from the London School of Economics (LSE), supervised by Professors Jan van den Heuvel and Jozef Skokan. Prior to UCL, he held postdoctoral positions at Freie Universität Berlin (with Prof. Tibor Szabó) and ETH Zurich (with Prof. Benny Sudakov), and was a lecturer at Birkbeck, University of London.

His research interests include Latin squares, Ramsey theory, probability, graph partitioning, Hamiltonian cycles, graph limits, directed graphs, regularity lemmas, hypergraph matchings, algorithms, and positional games. He has contributed to numerous conferences and published extensively on topics such as monochromatic cycle partitioning, rainbow trees, Rota's basis conjecture, and extremal graph theory.

Key achievements include resolving Ringel's conjecture, counterexamples to Stein's equi-n-square conjecture, and advancements in understanding Ramsey numbers and graph decomposition. His work often bridges combinatorial theory and algorithmic applications, with a focus on structural graph properties and extremal problems.