32 citations · 98 across the 35 of their papers we have counts for
6 papers · 1 filter
Ramsey goodness of bounded degree trees
Igor Balla, Alexey Pokrovskiy, Benny Sudakov
Given a pair of graphs and , the Ramsey number is the smallest such that every red-blue coloring of the edges of the complete graph contains a red copy of…
An approximate version of a conjecture of Aharoni and Berger
Alexey Pokrovskiy
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by colours with at least edges of each colour there is a rainbow matching usi…
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
Noga Alon, Alexey Pokrovskiy, Benny Sudakov
A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly edge-coloured complete graph $…
Partitioning a graph into a cycle and a sparse graph
Alexey Pokrovskiy
In this paper we investigate results of the form "every graph has a cycle such that the induced subgraph of on has small maximum degree." Such resu…
Strong Ramsey Games: Drawing on an infinite board
Dan Hefetz, Christopher Kusch, Lothar Narins +3
We consider the strong Ramsey-type game , played on the edge set of the infinite complete -uniform hypergraph . Two p…
A family of extremal hypergraphs for Ryser's conjecture
Ahmad Abu-Khazneh, János Barát, Alexey Pokrovskiy +1
Ryser's Conjecture states that for any -partite -uniform hypergraph, the vertex cover number is at most times the matching number. This conjecture is only known to be…