Jozef Skokan

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 17

Top Topics

Rates Of Convergence

Top Venues

Electron. J. Comb.

Comb. Probab. Comput.

SIAM J. Discret. Math.

Random Struct. Algorithms

Publications

Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu
Beyond Chromatic Threshold via (p, q)-Theorem, and Blow-Up Phenomenon. SoCG (2024)
Domenico Mergoni Cecchelli, Peter Allen, Jozef Skokan, Barnaby Roberts
The Ramsey Numbers of Squares of Paths and Cycles. Electron. J. Comb. 31 (2) (2024)
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 (2024)
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 (2023)
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) (2023)
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
Triangles in randomly perturbed graphs. Comb. Probab. Comput. 32 (1) (2023)
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
Cycle factors in randomly perturbed graphs. LAGOS (2021)
Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies
An Approximate Blow-up Lemma for Sparse Hypergraphs. LAGOS (2021)
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) (2020)
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) (2020)
Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms 56 (2) (2020)
József Balogh, Bhargav P. Narayanan, Jozef Skokan
The number of hypergraphs without linear cycles. J. Comb. Theory, Ser. B 134 (2019)
József Balogh, Frank Mousset, Jozef Skokan
Stability for Vertex Cycle Covers. Electron. J. Comb. 24 (3) (2017)
Ryan R. Martin, Richard Mycroft, Jozef Skokan
An Asymptotic Multipartite Kühn-Osthus Theorem. SIAM J. Discret. Math. 31 (3) (2017)
Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot
Decomposing tournaments into paths. Electron. Notes Discret. Math. 61 (2017)
Ryan R. Martin, Jozef Skokan
Asymptotic multipartite version of the Alon-Yuster theorem. J. Comb. Theory, Ser. B 127 (2017)
Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan
On the Ramsey number of the triangle and the cube. Comb. 36 (1) (2016)
Peter Allen, Barnaby Roberts, Jozef Skokan
Ramsey Numbers of Squares of Paths. Electron. Notes Discret. Math. 49 (2015)
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) (2014)
Jozef Skokan, Maya Jakobine Stein
Cycles Are Strongly Ramsey-Unsaturated. Comb. Probab. Comput. 23 (4) (2014)
Peter Allen, Jozef Skokan, Andreas Würfl
Maximum Planar Subgraphs in Dense Graphs. Electron. J. Comb. 20 (3) (2013)
Peter Allen, Graham R. Brightwell, Jozef Skokan
Ramsey-goodness - and otherwise. Comb. 33 (2) (2013)
Tomasz Luczak, Miklós Simonovits, Jozef Skokan
On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69 (2) (2012)
Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White
Monochromatic Cycles in 2-Coloured Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger
Asymmetric Ramsey properties of random graphs involving cliques. Random Struct. Algorithms 34 (4) (2009)
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) (2009)
Fabrício Siqueira Benevides, Jozef Skokan
The 3-colored Ramsey number of even cycles. J. Comb. Theory, Ser. B 99 (4) (2009)
Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan
Tree representations of graphs. Eur. J. Comb. 28 (4) (2007)
Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan
Turán's theorem for pseudo-random graphs. J. Comb. Theory, Ser. A 114 (4) (2007)
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, Ser. A 113 (1) (2006)
Vojtech Rödl, Jozef Skokan
Applications of the regularity lemma for uniform hypergraphs. Random Struct. Algorithms 28 (2) (2006)
Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. APPROX-RANDOM (2006)
Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan
Transversal numbers of translates of a convex body. Discret. Math. 306 (18) (2006)
Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan
The 3-colored Ramsey number of odd cycles. Electron. Notes Discret. Math. 19 (2005)
Yuejian Peng, Vojtech Rödl, Jozef Skokan
Counting Small Cliques in 3-uniform Hypergraphs. Comb. Probab. Comput. 14 (3) (2005)
Vojtech Rödl, Jozef Skokan
Counting subgraphs in quasi-random 4-uniform hypergraphs. Random Struct. Algorithms 26 (1-2) (2005)
Vojtech Rödl, Jozef Skokan
Regularity Lemma for k-uniform hypergraphs. Random Struct. Algorithms 25 (1) (2004)
Jozef Skokan, Lubos Thoma
Bipartite Subgraphs and Quasi-Randomness. Graphs Comb. 20 (2) (2004)
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
Hypergraphs, Quasi-randomness, and Conditions for Regularity. J. Comb. Theory, Ser. A 97 (2) (2002)
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
Equivalent Conditions for Regularity (Extended Abstract). LATIN (2000)