Submitted
-
A proof of Ringel's Conjecture
R. Montgomery, A. Pokrovskiy. B. Sudakov
arXiv:2001.02665
-
The maximum length of Kr-Bootstrap Percolation
J. Balogh, G. Kronenberg, A. Pokrovskiy, T. Szabo
arXiv:1907.04559
-
Partitioning edge-coloured hypergraphs into few monochromatic tight cycles
S. Bustamante, J. Corsten, N. Frankl, A. Pokrovskiy, J. Skokan
arXiv:1903.04471
-
Minimum degree conditions for monochromatic cycle partitioning
D. Korandi, R. Lang, S. Letzter, A. Pokrovskiy
arXiv:1902.05882
-
Ramsey goodness of cycles
A. Pokrovskiy, B. Sudakov
arXiv:1607.03348
-
Partitioning a graph into a cycle and a sparse graph
A. Pokrovskiy
arXiv:1607.03348
To appear
-
Halfway to Rota's basis conjecture
M. Bucic, M. Kwan, A. Pokrovskiy, B. Sudakov
Int. Math. Res. Notices
-
2-factors with k cycles in Hamiltonian graphs
M. Bucic, E. Jahn, A. Pokrovskiy, B. Sudakov
J. Combin. Theory Ser. B
-
On the Odd Cycle Game and Connected Rules
J. Corsten, A. Mond, A. Pokrovskiy, C. Spiegel, T. Szab\'o
Europ. J. Combin.
-
Nearly-linear monotone paths in edge-ordered graphs
M. Bucic, M. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A. Wagner
Israel J. Math.
-
Embedding rainbow trees with applications to graph labelling and decomposition
R. Montgomery, A. Pokrovskiy, B. Sudakov
J. Europ. Math. Soc. (2019)
-
Long directed rainbow cycles and rainbow spanning trees
F. Benzing, A. Pokrovskiy, B. Sudakov
Europ. J. Combin. (2019)
Published
2019
-
Decompositions into spanning rainbow structures
R. Montgomery, A. Pokrovskiy, B. Sudakov
Proc. Lond. Math. Soc.(2019)
-
A counterexample to Stein's Equi-n-square Conjecture
A. Pokrovskiy, B. Sudakov
Proc. Amer. Math. Soc. (2018) 2281-2287.
-
On the size-Ramsey number of cycles
R. Javadi, F. Khoeini, G. R. Omidi, A. Pokrovskiy
Combin. Probab. Comput. (2019)
-
A family of extremal hypergraphs for Ryser's conjecture
A. Abu-Khazneh, J. Barat, A. Pokrovskiy, T. Szabo
J. Combin. Theory Ser. B, 161 (2019) 164-177.
2018
2017
-
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
N. Alon, A. Pokrovskiy, B. Sudakov
Israel Journal of Mathematics, 222, (2017) 317-331.
-
A remark on Hamilton cycles with few colors
I. Balla, A. Pokrovskiy, B. Sudakov
Mosc. J. Comb. Number Theory, 7, (2017) 73-77.
-
Rainbow matchings and rainbow connectedness
A. Pokrovskiy
Electron. J. Combin, 24 (2017)
-
Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs
A. Abu-Khazneh, A. Pokrovskiy
J. Combin. Math. Combin. Comput., 103 (2018) 81-104.
-
Graphs without proper subgraphs of minimum degree 3 and short cycles
L. Narins, A. Pokrovskiy, T. Szabo
Combinatorica, 37 (2017) 495-519.
-
Strong Ramsey Games: Drawing on an infinite board
D. Hefetz, C. Kusch, L. Narins, A. Pokrovskiy, C. Requile, A. Sarid
J. Combin Theory Ser. A, 150 (2017) 248-266
-
Edge disjoint Hamiltonian cycles in highly connected tournaments
A. Pokrovskiy
Int. Math. Res. Notices, 2 (2017) 429-467
-
Calculating Ramsey numbers by partitioning coloured graphs
A. Pokrovskiy
J. Graph Theory, 84 (2017) 477-500.
-
Ramsey goodness of paths
A. Pokrovskiy, B. Sudakov
J. Combin. Theory Ser. B., 122 (2017) 109-120
-
On sets not belonging to algebras and rainbow matchings in graphs
D. Clemens, J. Ehrenmuller, A. Pokrovskiy
J. Combin. Theory Ser. B., 122 (2017) 384-390
2015
2014
2011
2010
2009
2008