default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey Pokrovskiy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Tom Kelly, Alp Müyesser, Alexey Pokrovskiy:
Optimal spread for spanning subgraphs of Dirac hypergraphs. J. Comb. Theory B 169: 507-541 (2024)- 2023
- [j29]Alexey Pokrovskiy
:
Partitioning a graph into a cycle and a sparse graph. Discret. Math. 346(1): 113161 (2023) - 2021
- [j28]Dániel Korándi, Richard Lang, Shoham Letzter, Alexey Pokrovskiy:
Minimum degree conditions for monochromatic cycle partitioning. J. Comb. Theory B 146: 96-123 (2021) - [j27]Shagnik Das, Alexey Pokrovskiy, Benny Sudakov:
Isomorphic bisections of cubic graphs. J. Comb. Theory B 151: 465-481 (2021) - 2020
- [j26]Frederik Benzing, Alexey Pokrovskiy, Benny Sudakov:
Long directed rainbow cycles and rainbow spanning trees. Eur. J. Comb. 88: 103102 (2020) - [j25]Jan Corsten, Adva Mond, Alexey Pokrovskiy, Christoph Spiegel, Tibor Szabó:
On the odd cycle game and connected rules. Eur. J. Comb. 89: 103140 (2020) - [j24]Matija Bucic, Erik Jahn, Alexey Pokrovskiy, Benny Sudakov:
2-factors with k cycles in Hamiltonian graphs. J. Comb. Theory B 144: 150-166 (2020) - [j23]Sebastián Bustamante, Jan Corsten, Nóra Frankl, Alexey Pokrovskiy, Jozef Skokan:
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles. SIAM J. Discret. Math. 34(2): 1460-1471 (2020) - [j22]Alexey Pokrovskiy, Benny Sudakov:
Ramsey Goodness of Cycles. SIAM J. Discret. Math. 34(3): 1884-1908 (2020)
2010 – 2019
- 2019
- [j21]Ramin Javadi, Farideh Khoeini, G. R. Omidi, Alexey Pokrovskiy:
On the Size-Ramsey Number of Cycles. Comb. Probab. Comput. 28(6): 871-880 (2019) - [j20]A. Abu-Khazneh, János Barát, Alexey Pokrovskiy, Tibor Szabó:
A family of extremal hypergraphs for Ryser's conjecture. J. Comb. Theory A 161: 164-177 (2019) - 2018
- [j19]Igor Balla, Alexey Pokrovskiy, Benny Sudakov:
Ramsey Goodness of Bounded Degree Trees. Comb. Probab. Comput. 27(3): 289-309 (2018) - [j18]Alexey Pokrovskiy, Benny Sudakov:
Linearly many rainbow trees in properly edge-coloured complete graphs. J. Comb. Theory B 132: 134-156 (2018) - 2017
- [j17]Lothar Narins, Alexey Pokrovskiy, Tibor Szabó:
Graphs without proper subgraphs of minimum degree 3 and short cycles. Comb. 37(3): 495-519 (2017) - [j16]Alexey Pokrovskiy:
Rainbow Matchings and Rainbow Connectedness. Electron. J. Comb. 24(1): 1 (2017) - [j15]Alexey Pokrovskiy, Benny Sudakov:
Edge-disjoint rainbow trees in properly coloured complete graphs. Electron. Notes Discret. Math. 61: 995-1001 (2017) - [j14]Dennis Clemens, Julia Ehrenmüller, Alexey Pokrovskiy:
On sets not belonging to algebras and rainbow matchings in graphs. J. Comb. Theory B 122: 109-120 (2017) - [j13]Alexey Pokrovskiy, Benny Sudakov:
Ramsey goodness of paths. J. Comb. Theory B 122: 384-390 (2017) - [j12]Dan Hefetz, Christopher Kusch, Lothar Narins, Alexey Pokrovskiy, Clément Requilé, Amir Sarid:
Strong Ramsey games: Drawing on an infinite board. J. Comb. Theory A 150: 248-266 (2017) - [j11]Alexey Pokrovskiy:
Calculating Ramsey Numbers by Partitioning Colored Graphs. J. Graph Theory 84(4): 477-500 (2017) - 2015
- [j10]Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy, Balázs Patkós, Alexey Pokrovskiy, Máté Vizer:
Identifying codes and searching with balls in graphs. Discret. Appl. Math. 193: 39-47 (2015) - [j9]Alexey Pokrovskiy:
Rainbow matchings and connectedness of coloured graphs. Electron. Notes Discret. Math. 49: 371-376 (2015) - [j8]Alexey Pokrovskiy:
Highly linked tournaments. J. Comb. Theory B 115: 339-347 (2015) - [j7]Alexey Pokrovskiy:
A linear bound on the Manickam-Miklós-Singhi conjecture. J. Comb. Theory A 133: 280-306 (2015) - 2014
- [j6]Alexey Pokrovskiy:
Edge growth in graph powers. Australas. J Comb. 58: 347-357 (2014) - [j5]Alexey Pokrovskiy:
Partitioning edge-coloured complete graphs into monochromatic cycles and paths. J. Comb. Theory B 106: 70-97 (2014) - [j4]Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. J. Graph Algorithms Appl. 18(3): 439-457 (2014) - 2013
- [j3]Alexey Pokrovskiy:
Partitioning edge-coloured complete graphs into monochromatic cycles. Electron. Notes Discret. Math. 43: 311-317 (2013) - [i1]Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. CoRR abs/1303.0523 (2013) - 2011
- [j2]Alexey Pokrovskiy:
Growth of Graph Powers. Electron. J. Comb. 18(1) (2011) - [j1]Alexey Pokrovskiy:
Partitioning 3-coloured complete graphs into three monochromatic paths. Electron. Notes Discret. Math. 38: 717-722 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
