default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJozef Skokan
Person information
- affiliation: University of Illinois, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Domenico Mergoni Cecchelli, Peter Allen, Jozef Skokan
, Barnaby Roberts:
The Ramsey Numbers of Squares of Paths and Cycles. Electron. J. Comb. 31(2) (2024)- [j33]Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein:
Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. Eur. J. Comb. 121: 103838 (2024) - [c5]Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu:
Beyond Chromatic Threshold via (p, q)-Theorem, and Blow-Up Phenomenon. SoCG 2024: 71:1-71:15 - 2023
- [j32]Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan:
Triangles in randomly perturbed graphs. Comb. Probab. Comput. 32(1): 91-121 (2023) - [j31]Anita Liebenau, Letícia Mattos, Walner Mendonça, Jozef Skokan:
Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Struct. Algorithms 62(4): 1035-1055 (2023) - [i1]Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan:
Separating the edges of a graph by a linear number of paths. CoRR abs/2301.08707 (2023) - 2021
- [c4]Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies:
An Approximate Blow-up Lemma for Sparse Hypergraphs. LAGOS 2021: 394-403 - [c3]Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan:
Cycle factors in randomly perturbed graphs. LAGOS 2021: 404-411 - 2020
- [j30]József Balogh, Felix Christian Clemen, Jozef Skokan, Adam Zsolt Wagner:
The Ramsey Number of Fano Plane Versus Tight Path. Electron. J. Comb. 27(1): 1 (2020) - [j29]Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein:
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms 56(2): 306-338 (2020) - [j28]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)
2010 – 2019
- 2019
- [j27]József Balogh, Bhargav P. Narayanan, Jozef Skokan:
The number of hypergraphs without linear cycles. J. Comb. Theory B 134: 309-321 (2019) - 2017
- [j26]József Balogh, Frank Mousset, Jozef Skokan:
Stability for Vertex Cycle Covers. Electron. J. Comb. 24(3): 3 (2017) - [j25]Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot:
Decomposing tournaments into paths. Electron. Notes Discret. Math. 61: 813-818 (2017) - [j24]Ryan R. Martin, Jozef Skokan:
Asymptotic multipartite version of the Alon-Yuster theorem. J. Comb. Theory B 127: 32-52 (2017) - [j23]Ryan R. Martin, Richard Mycroft, Jozef Skokan:
An Asymptotic Multipartite Kühn-Osthus Theorem. SIAM J. Discret. Math. 31(3): 1498-1513 (2017) - 2016
- [j22]Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan:
On the Ramsey number of the triangle and the cube. Comb. 36(1): 71-89 (2016) - 2015
- [j21]Peter Allen, Barnaby Roberts, Jozef Skokan:
Ramsey Numbers of Squares of Paths. Electron. Notes Discret. Math. 49: 637-641 (2015) - 2014
- [j20]Jozef Skokan, Maya Jakobine Stein:
Cycles Are Strongly Ramsey-Unsaturated. Comb. Probab. Comput. 23(4): 607-630 (2014) - [j19]Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan:
The Ramsey number of the clique and the hypercube. J. Lond. Math. Soc. 89(3): 680-702 (2014) - 2013
- [j18]Peter Allen, Graham R. Brightwell, Jozef Skokan:
Ramsey-goodness - and otherwise. Comb. 33(2): 125-160 (2013) - [j17]Peter Allen, Jozef Skokan, Andreas Würfl:
Maximum Planar Subgraphs in Dense Graphs. Electron. J. Comb. 20(3): 1 (2013) - 2012
- [j16]Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White:
Monochromatic Cycles in 2-Coloured Graphs. Comb. Probab. Comput. 21(1-2): 57-87 (2012) - [j15]Tomasz Luczak, Miklós Simonovits, Jozef Skokan:
On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69(2): 169-175 (2012)
2000 – 2009
- 2009
- [j14]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan:
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Comb. Probab. Comput. 18(1-2): 165-203 (2009) - [j13]Fabrício Siqueira Benevides, Jozef Skokan:
The 3-colored Ramsey number of even cycles. J. Comb. Theory B 99(4): 690-708 (2009) - [j12]Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger:
Asymmetric Ramsey properties of random graphs involving cliques. Random Struct. Algorithms 34(4): 419-453 (2009) - 2007
- [j11]Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan:
Tree representations of graphs. Eur. J. Comb. 28(4): 1087-1098 (2007) - [j10]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan:
Turán's theorem for pseudo-random graphs. J. Comb. Theory A 114(4): 631-657 (2007) - 2006
- [j9]Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan:
Transversal numbers of translates of a convex body. Discret. Math. 306(18): 2166-2173 (2006) - [j8]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan:
The Ramsey number for hypergraph cycles I. J. Comb. Theory A 113(1): 67-83 (2006) - [j7]Vojtech Rödl, Jozef Skokan:
Applications of the regularity lemma for uniform hypergraphs. Random Struct. Algorithms 28(2): 180-194 (2006) - [c2]Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger:
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. APPROX-RANDOM 2006: 462-474 - 2005
- [j6]Yuejian Peng, Vojtech Rödl, Jozef Skokan:
Counting Small Cliques in 3-uniform Hypergraphs. Comb. Probab. Comput. 14(3): 371-413 (2005) - [j5]Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan:
The 3-colored Ramsey number of odd cycles. Electron. Notes Discret. Math. 19: 397-402 (2005) - [j4]Vojtech Rödl, Jozef Skokan:
Counting subgraphs in quasi-random 4-uniform hypergraphs. Random Struct. Algorithms 26(1-2): 160-203 (2005) - 2004
- [j3]Jozef Skokan, Lubos Thoma:
Bipartite Subgraphs and Quasi-Randomness. Graphs Comb. 20(2): 255-262 (2004) - [j2]Vojtech Rödl, Jozef Skokan:
Regularity Lemma for k-uniform hypergraphs. Random Struct. Algorithms 25(1): 1-42 (2004) - 2002
- [j1]Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan:
Hypergraphs, Quasi-randomness, and Conditions for Regularity. J. Comb. Theory A 97(2): 307-352 (2002) - 2000
- [c1]Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan:
Equivalent Conditions for Regularity (Extended Abstract). LATIN 2000: 48-57
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 22:14 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:
