Growth of Graph Powers. - Alexey Pokrovskiy (Electron. J. Comb., 2011)

Partitioning 3-coloured complete graphs into three monochromatic paths. - Alexey Pokrovskiy (Electron. Notes Discret. Math., 2011)

Partitioning edge-coloured complete graphs into monochromatic cycles. - Alexey Pokrovskiy (Electron. Notes Discret. Math., 2013)

Edge growth in graph powers. - Alexey Pokrovskiy (Australas. J Comb., 2014)

Partitioning edge-coloured complete graphs into monochromatic cycles and paths. - Alexey Pokrovskiy (J. Comb. Theory B, 2014)

Advantage in the discrete Voronoi game. - Dániel Gerbner; Viola Mészáros; Dömötör Pálvölgyi; Alexey Pokrovskiy; Günter Rote (J. Graph Algorithms Appl., 2014)

Identifying codes and searching with balls in graphs. - Younjin Kim; Mohit Kumbhat; Zoltán Lóránt Nagy; Balázs Patkós; Alexey Pokrovskiy; Máté Vizer (Discret. Appl. Math., 2015)

Rainbow matchings and connectedness of coloured graphs. - Alexey Pokrovskiy (Electron. Notes Discret. Math., 2015)

A linear bound on the Manickam-Miklós-Singhi conjecture. - Alexey Pokrovskiy (J. Comb. Theory A, 2015)

Highly linked tournaments. - Alexey Pokrovskiy (J. Comb. Theory B, 2015)

Graphs without proper subgraphs of minimum degree 3 and short cycles. - Lothar Narins; Alexey Pokrovskiy; Tibor Szabó (Comb., 2017)

Rainbow Matchings and Rainbow Connectedness. - Alexey Pokrovskiy (Electron. J. Comb., 2017)

Edge-disjoint rainbow trees in properly coloured complete graphs. - Alexey Pokrovskiy; Benny Sudakov (Electron. Notes Discret. Math., 2017)

On sets not belonging to algebras and rainbow matchings in graphs. - Dennis Clemens; Julia Ehrenmüller; Alexey Pokrovskiy (J. Comb. Theory B, 2017)

Strong Ramsey games: Drawing on an infinite board. - Dan Hefetz; Christopher Kusch; Lothar Narins; Alexey Pokrovskiy; Clément Requilé; Amir Sarid (J. Comb. Theory A, 2017)

Ramsey goodness of paths. - Alexey Pokrovskiy; Benny Sudakov (J. Comb. Theory B, 2017)

Calculating Ramsey Numbers by Partitioning Colored Graphs. - Alexey Pokrovskiy (J. Graph Theory, 2017)

Ramsey Goodness of Bounded Degree Trees. - Igor Balla; Alexey Pokrovskiy; Benny Sudakov (Comb. Probab. Comput., 2018)

Linearly many rainbow trees in properly edge-coloured complete graphs. - Alexey Pokrovskiy; Benny Sudakov (J. Comb. Theory B, 2018)

On the Size-Ramsey Number of Cycles. - Ramin Javadi; Farideh Khoeini; G. R. Omidi; Alexey Pokrovskiy (Comb. Probab. Comput., 2019)

A family of extremal hypergraphs for Ryser's conjecture. - A. Abu-Khazneh; János Barát; Alexey Pokrovskiy; Tibor Szabó (J. Comb. Theory A, 2019)

Long directed rainbow cycles and rainbow spanning trees. - Frederik Benzing; Alexey Pokrovskiy; Benny Sudakov (Eur. J. Comb., 2020)

On the odd cycle game and connected rules. - Jan Corsten; Adva Mond; Alexey Pokrovskiy; Christoph Spiegel 002; Tibor Szabó (Eur. J. Comb., 2020)

2-factors with k cycles in Hamiltonian graphs. - Matija Bucic; Erik Jahn; Alexey Pokrovskiy; Benny Sudakov (J. Comb. Theory B, 2020)

Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles. - Sebastián Bustamante 001; Jan Corsten; Nóra Frankl; Alexey Pokrovskiy; Jozef Skokan (SIAM J. Discret. Math., 2020)

Ramsey Goodness of Cycles. - Alexey Pokrovskiy; Benny Sudakov (SIAM J. Discret. Math., 2020)

Isomorphic bisections of cubic graphs. - Shagnik Das; Alexey Pokrovskiy; Benny Sudakov (J. Comb. Theory B, 2021)

Minimum degree conditions for monochromatic cycle partitioning. - Dániel Korándi; Richard Lang; Shoham Letzter; Alexey Pokrovskiy (J. Comb. Theory B, 2021)

Partitioning a graph into a cycle and a sparse graph. - Alexey Pokrovskiy (Discret. Math., 2023)

Optimal spread for spanning subgraphs of Dirac hypergraphs. - Tom Kelly 001; Alp Müyesser; Alexey Pokrovskiy (J. Comb. Theory B, 2024)

Erdős-Szekeres Maker-Breaker Games. - Aleksa Dzuklevski; Dömötör Pálvölgyi; Alexey Pokrovskiy; Csaba D. Tóth; Tomás Valla; Lander Verlinde (COCOON (1), 2025)

Ascending subgraph decomposition. - Kyriakos Katsamaktsis; Shoham Letzter; Alexey Pokrovskiy; Benny Sudakov (J. Comb. Theory B, 2025)