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 2017Show all

5 papers · 1 filter

math.CO2017

Long directed rainbow cycles and rainbow spanning trees

Frederik Benzing, Alexey Pokrovskiy, Benny Sudakov

A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. The problem of finding rainbow subgraphs goes back to the work of Euler on transvers…

math.CO2017

A counterexample to Stein's Equi-n-square Conjecture

Alexey Pokrovskiy, Benny Sudakov

In 1975 Stein conjectured that in every $n \times n$ array filled with the numbers $1, \dots, n$ with every number occuring exactly $n$ times, there is a partial transversal of size…

math.CO2017★ 1 cited

A remark on Hamilton cycles with few colors

Igor Balla, Alexey Pokrovskiy, Benny Sudakov

Akbari, Etesami, Mahini, and Mahmoody conjectured that every proper edge colouring of $K_{n}$ with $n$ colours contains a Hamilton cycle with $\leq O (lo g n)$ colours. They proved th…

math.CO2017★ 4 cited

Linearly many rainbow trees in properly edge-coloured complete graphs

Alexey Pokrovskiy, Benny Sudakov

A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. The study of rainbow decompositions has a long history, going back to the w…

math.CO2017

On the size-Ramsey number of cycles

Ramin Javadi, Farideh Khoeini, Gholam Reza Omidi +1

For given graphs $G_{1}, \dots, G_{k}$ , the size-Ramsey number $R^(G_{1}, \dots, G_{k})$ is the smallest integer $m$ for which there exists a graph $H$ on $m$ edges such that in every $…