A. Pokrovskiy

activity

20102026

most citedDecompositions into spanning rainbow structures

32 citations · 98 across the 35 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Minimising the harmonic sum of cycle lengths

Richard Montgomery, Aleksa Milojević, Alexey Pokrovskiy +1

A central theme in extremal graph theory is to understand the relationship between the density of a graph and the richness of its cycle length spectrum, which is the set of distinc…

math.CO2026

A proof of Andersen's rainbow path conjecture for large $n$

Candida Bowtell, Richard Montgomery, Alp Müyesser +1

We show that, for sufficiently large $n$ , every properly edge-coloured $n$ -vertex complete graph contains a path with $n - 1$ vertices which uses each colour at most once (that is, a…

math.CO2026

Nearly-uniform degree distributions in spanning subgraphs

Richard Montgomery, Alexey Pokrovskiy, Benny Sudakov

We show that, when $d = o (n)$ , every $d$ -regular $n$ -vertex graph contains a spanning subgraph whose degree distribution is nearly uniform, i.e., for each $0 \leq i \leq d$ , there are…

Minimising the harmonic sum of cycle lengths

A proof of Andersen's rainbow path conjecture for large n

Nearly-uniform degree distributions in spanning subgraphs

A proof of Andersen's rainbow path conjecture for large $n$