Alexey Gordeev

About Me

I am a postdoc at Umeå University, working with Lars-Daniel Öhman.

I completed my PhD in 2022 at St.Petersburg Department of V.A. Steklov Institute (PDMI RAS), advised by Fedor Petrov. You can find my thesis (in Russian) here.

You can find my CV here.

Research Interests

list colorings of graphs and hypergraphs, polynomial method in combinatorics, extremal hypergraph problems, maximal distance minimizers, row-column designs

Papers

Cayley incidence graphs
A.S. Árnadóttir, A. Gordeev, S. Lato, T. Randrianarisoa, J. Vermant
arXiv:2411.19428, 2024.
[PDF]
Combinatorial Nullstellensatz and Turán numbers of complete r-partite r-uniform hypergraphs
A. Gordeev
Discrete Mathematics, 347(7), 114037, 2024.
[Link] [arXiv version]
Erdős–Hajnal problem for H-free hypergraphs
D. Cherkashin, A. Gordeev, G. Strukov
Graphs and Combinatorics, 40(1), 1–15, 2024.
[Link] [Full text view-only] [arXiv version]
On regularity of maximal distance minimizers in R^n
A. Gordeev, Y. Teplitskaya
To appear in Annali della Scuola Normale di Pisa - Classe di Scienze, 2023.
[Link] [arXiv version]
The Alon–Tarsi Number of A Toroidal Grid
Z. Li, Z. Shao, F. Petrov, A. Gordeev
European Journal of Combinatorics, 111, 103697, 2023.
[Link][arXiv version]
On list chromatic numbers of 2-colorable hypergraphs
D. Cherkashin, A. Gordeev
Proceedings of MIPT, 14(1), 49-57, 2022.
[PDF] [arXiv version]
Alon–Tarsi numbers of direct products
F. Petrov, A. Gordeev
Moscow Journal of Combinatorics and Number Theory 10(4), 271–279, 2021.
[Link] [arXiv version]
Maximal distance minimizers for a rectangle
D. Cherkashin, A. Gordeev, G. Strukov, Y. Teplitskaya
arXiv:2106.00809, 2021.
[PDF]
On minimizers of the maximal distance functional for a planar convex closed smooth curve
D. Cherkashin, A. Gordeev, G. Strukov, Y. Teplitskaya
arXiv:2011.10463, 2020.
[PDF]
Constant terms of near-Dyson polynomials
A. Gordeev
The Electronic Journal of Combinatorics 25(4), 2018.
[PDF] [Link]

Teaching

Lecturer at Saint Petersburg State University (Spring 2019 – Fall 2021)
Algorithms and Data Structures
a 3 semester undergraduate course in “Modern Programming” bachelor programme
Lecture notes (in Russian): [1 semester] [2 semester] [3 semester]