Alexey Pokrovskiy

According to our database1, Alexey Pokrovskiy authored at least 25 papers between 2011 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles.
SIAM J. Discret. Math., 2020

2-factors with <i>k</i> cycles in Hamiltonian graphs.
J. Comb. Theory, Ser. B, 2020

On the odd cycle game and connected rules.
Eur. J. Comb., 2020

Long directed rainbow cycles and rainbow spanning trees.
Eur. J. Comb., 2020

2019
A family of extremal hypergraphs for Ryser's conjecture.
J. Comb. Theory, Ser. A, 2019

On the Size-Ramsey Number of Cycles.
Comb. Probab. Comput., 2019

2018
Linearly many rainbow trees in properly edge-coloured complete graphs.
J. Comb. Theory, Ser. B, 2018

Ramsey Goodness of Bounded Degree Trees.
Comb. Probab. Comput., 2018

2017
Calculating Ramsey Numbers by Partitioning Colored Graphs.
J. Graph Theory, 2017

Ramsey goodness of paths.
J. Comb. Theory, Ser. B, 2017

Strong Ramsey games: Drawing on an infinite board.
J. Comb. Theory, Ser. A, 2017

On sets not belonging to algebras and rainbow matchings in graphs.
J. Comb. Theory, Ser. B, 2017

Edge-disjoint rainbow trees in properly coloured complete graphs.
Electron. Notes Discret. Math., 2017

Rainbow Matchings and Rainbow Connectedness.
Electron. J. Comb., 2017

Graphs without proper subgraphs of minimum degree 3 and short cycles.
Comb., 2017

2015
Highly linked tournaments.
J. Comb. Theory, Ser. B, 2015

A linear bound on the Manickam-Miklós-Singhi conjecture.
J. Comb. Theory, Ser. A, 2015

Rainbow matchings and connectedness of coloured graphs.
Electron. Notes Discret. Math., 2015

Identifying codes and searching with balls in graphs.
Discret. Appl. Math., 2015

2014
Advantage in the discrete Voronoi game.
J. Graph Algorithms Appl., 2014

Partitioning edge-coloured complete graphs into monochromatic cycles and paths.
J. Comb. Theory, Ser. B, 2014

Edge growth in graph powers.
Australas. J Comb., 2014

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

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

Growth of Graph Powers.
Electron. J. Comb., 2011


  Loading...