Alexey Pokrovskiy

collaborators

5 papers

math.CO2026

Towards the Lovász conjecture via sublinear expanders

Matija Bucić, Micha Christoph, Alexey Pokrovskiy +1

Lovász' famous Hamiltonicity conjecture (1969) states that every connected vertex-transitive graph has a Hamiltonian path. A stronger version of the conjecture, often attributed to…

math.CO2026

Ramsey number of a cycle versus a graph of a given size

Stijn Cambie, Andrea Freschi, Patryk Morawski +2

In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R (C_{k}, H)$ is at most $2 m + ⌊ \frac{k - 1}{2} ⌋$ ,…

math.CO2025

Hamiltonicity and structure of connected biclaw-free graphs

Alexey Pokrovskiy, Xiaoan Yang

We show that for sufficiently large $d$ , every balanced bipartite, connected biclaw-free graph with minimum degree $\geq d$ is Hamiltonian. This confirms a conjecture of Flandrin,…

math.CO2025

Bounded diameter monochromatic component covers

Alexey Pokrovskiy

Ryser conjectured that every $r$ -edge-coloured complete graph can be covered by $r - 1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted someth…

math.CO2025

Erdős-Szekeres Maker-Breaker Games

Aleksa Džuklevski, Dömötör Pálvölgyi, Alexey Pokrovskiy +3

We present new results on Maker-Breaker games arising from the Erdős-Szekeres problem in planar geometry. This classical problem asks how large a set in general position has to be…