Alexey Pokrovskiy

35 papers A* 1Journal 33Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers.
J. Comb. Theory B
Alexey Pokrovskiy, Leo Versteegen, Ella Williams
2026 A* conf
On Independent Spanning Trees in Random Graphs.
SODA
Nemanja Draganic, Keith Frankston, Michael Krivelevich, Alexey Pokrovskiy, Liana Yepremyan
2025 J jnl
Ascending subgraph decomposition.
J. Comb. Theory B
Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy, Benny Sudakov
2025 — conf
Erdős-Szekeres Maker-Breaker Games.
COCOON (1)
Aleksa Dzuklevski, Dömötör Pálvölgyi, Alexey Pokrovskiy, Csaba D. Tóth, Tomás Valla, Lander Verlinde
2024 J jnl
Optimal spread for spanning subgraphs of Dirac hypergraphs.
J. Comb. Theory B
Tom Kelly, Alp Müyesser, Alexey Pokrovskiy
2023 J jnl
Partitioning a graph into a cycle and a sparse graph.
Discret. Math.
Alexey Pokrovskiy
2021 J jnl
Isomorphic bisections of cubic graphs.
J. Comb. Theory B
Shagnik Das, Alexey Pokrovskiy, Benny Sudakov
2021 J jnl
Minimum degree conditions for monochromatic cycle partitioning.
J. Comb. Theory B
Dániel Korándi, Richard Lang, Shoham Letzter, Alexey Pokrovskiy
2020 J jnl
2-factors with
J. Comb. Theory B
Matija Bucic, Erik Jahn, Alexey Pokrovskiy, Benny Sudakov
2020 J jnl
Long directed rainbow cycles and rainbow spanning trees.
Eur. J. Comb.
Frederik Benzing, Alexey Pokrovskiy, Benny Sudakov
2020 J jnl
On the odd cycle game and connected rules.
Eur. J. Comb.
Jan Corsten, Adva Mond, Alexey Pokrovskiy, Christoph Spiegel, Tibor Szabó
2020 J jnl
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles.
SIAM J. Discret. Math.
Sebastián Bustamante, Jan Corsten, Nóra Frankl, Alexey Pokrovskiy, Jozef Skokan
2020 J jnl
Ramsey Goodness of Cycles.
SIAM J. Discret. Math.
Alexey Pokrovskiy, Benny Sudakov
2019 J jnl
A family of extremal hypergraphs for Ryser's conjecture.
J. Comb. Theory A
A. Abu-Khazneh, János Barát, Alexey Pokrovskiy, Tibor Szabó
2019 J jnl
On the Size-Ramsey Number of Cycles.
Comb. Probab. Comput.
Ramin Javadi, Farideh Khoeini, G. R. Omidi, Alexey Pokrovskiy
2018 J jnl
Linearly many rainbow trees in properly edge-coloured complete graphs.
J. Comb. Theory B
Alexey Pokrovskiy, Benny Sudakov
2018 J jnl
Ramsey Goodness of Bounded Degree Trees.
Comb. Probab. Comput.
Igor Balla, Alexey Pokrovskiy, Benny Sudakov
2017 J jnl
Calculating Ramsey Numbers by Partitioning Colored Graphs.
J. Graph Theory
Alexey Pokrovskiy
2017 J jnl
Edge-disjoint rainbow trees in properly coloured complete graphs.
Electron. Notes Discret. Math.
Alexey Pokrovskiy, Benny Sudakov
2017 J jnl
Graphs without proper subgraphs of minimum degree 3 and short cycles.
Comb.
Lothar Narins, Alexey Pokrovskiy, Tibor Szabó
2017 J jnl
On sets not belonging to algebras and rainbow matchings in graphs.
J. Comb. Theory B
Dennis Clemens, Julia Ehrenmüller, Alexey Pokrovskiy
2017 J jnl
Rainbow Matchings and Rainbow Connectedness.
Electron. J. Comb.
Alexey Pokrovskiy
2017 J jnl
Ramsey goodness of paths.
J. Comb. Theory B
Alexey Pokrovskiy, Benny Sudakov
2017 J jnl
Strong Ramsey games: Drawing on an infinite board.
J. Comb. Theory A
Dan Hefetz, Christopher Kusch, Lothar Narins, Alexey Pokrovskiy, Clément Requilé, Amir Sarid
2015 J jnl
A linear bound on the Manickam-Miklós-Singhi conjecture.
J. Comb. Theory A
Alexey Pokrovskiy
2015 J jnl
Highly linked tournaments.
J. Comb. Theory B
Alexey Pokrovskiy
2015 J jnl
Identifying codes and searching with balls in graphs.
Discret. Appl. Math.
Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy, Balázs Patkós, Alexey Pokrovskiy, Máté Vizer
2015 J jnl
Rainbow matchings and connectedness of coloured graphs.
Electron. Notes Discret. Math.
Alexey Pokrovskiy
2014 J jnl
Advantage in the discrete Voronoi game.
J. Graph Algorithms Appl.
Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote
2014 J jnl
Edge growth in graph powers.
Australas. J Comb.
Alexey Pokrovskiy
2014 J jnl
Partitioning edge-coloured complete graphs into monochromatic cycles and paths.
J. Comb. Theory B
Alexey Pokrovskiy
2013 J jnl
Advantage in the discrete Voronoi game
CoRR
Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote
2013 J jnl
Partitioning edge-coloured complete graphs into monochromatic cycles.
Electron. Notes Discret. Math.
Alexey Pokrovskiy
2011 J jnl
Growth of Graph Powers.
Electron. J. Comb.
Alexey Pokrovskiy
2011 J jnl
Partitioning 3-coloured complete graphs into three monochromatic paths.
Electron. Notes Discret. Math.
Alexey Pokrovskiy