Jozef Skokan

43 papers A* 1B 1C 2Journal 38Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Alternating Paths in Oriented Graphs with Large Semidegree.
Electron. J. Comb.
Jozef Skokan, Mykhaylo Tyomkyn
2024 J jnl
A robust Corrádi-Hajnal theorem.
Random Struct. Algorithms
Peter Allen, Julia Böttcher, Jan Corsten, Ewan Davies, Matthew Jenssen, Patrick Morris, Barnaby Roberts, Jozef Skokan
2024 A* conf
Beyond Chromatic Threshold via (p, q)-Theorem, and Blow-Up Phenomenon.
SoCG
Hong Liu, Chong Shangguan, Jozef Skokan, Zixiang Xu
2024 J jnl
Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles.
Eur. J. Comb.
Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein
2024 J jnl
The Ramsey Numbers of Squares of Paths and Cycles.
Electron. J. Comb.
Domenico Mergoni Cecchelli, Peter Allen, Jozef Skokan, Barnaby Roberts
2024 J jnl
The square of a Hamilton cycle in randomly perturbed graphs.
Random Struct. Algorithms
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
2023 J jnl
Asymmetric Ramsey properties of random graphs involving cliques and cycles.
Random Struct. Algorithms
Anita Liebenau, Letícia Mattos, Walner Mendonça, Jozef Skokan
2023 J jnl
Separating the edges of a graph by a linear number of paths.
CoRR
Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan
2023 J jnl
Triangles in randomly perturbed graphs.
Comb. Probab. Comput.
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
2021 C conf
An Approximate Blow-up Lemma for Sparse Hypergraphs.
LAGOS
Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies
2021 C conf
Cycle factors in randomly perturbed graphs.
LAGOS
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
2020 J jnl
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles.
SIAM J. Discret. Math.
Sebastián Bustamante, Jan Corsten, Nóra Frankl, Alexey Pokrovskiy, Jozef Skokan
2020 J jnl
Regularity inheritance in pseudorandom graphs.
Random Struct. Algorithms
Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein
2020 J jnl
The Ramsey Number of Fano Plane Versus Tight Path.
Electron. J. Comb.
József Balogh, Felix Christian Clemen, Jozef Skokan, Adam Zsolt Wagner
2019 J jnl
The number of hypergraphs without linear cycles.
J. Comb. Theory B
József Balogh, Bhargav P. Narayanan, Jozef Skokan
2017 J jnl
An Asymptotic Multipartite Kühn-Osthus Theorem.
SIAM J. Discret. Math.
Ryan R. Martin, Richard Mycroft, Jozef Skokan
2017 J jnl
Asymptotic multipartite version of the Alon-Yuster theorem.
J. Comb. Theory B
Ryan R. Martin, Jozef Skokan
2017 J jnl
Decomposing tournaments into paths.
Electron. Notes Discret. Math.
Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot
2017 J jnl
Stability for Vertex Cycle Covers.
Electron. J. Comb.
József Balogh, Frank Mousset, Jozef Skokan
2016 J jnl
On the Ramsey number of the triangle and the cube.
Comb.
Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan
2015 J jnl
Ramsey Numbers of Squares of Paths.
Electron. Notes Discret. Math.
Peter Allen, Barnaby Roberts, Jozef Skokan
2014 J jnl
Cycles Are Strongly Ramsey-Unsaturated.
Comb. Probab. Comput.
Jozef Skokan, Maya Jakobine Stein
2014 J jnl
The Ramsey number of the clique and the hypercube.
J. Lond. Math. Soc.
Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan
2013 J jnl
Maximum Planar Subgraphs in Dense Graphs.
Electron. J. Comb.
Peter Allen, Jozef Skokan, Andreas Würfl
2013 J jnl
Ramsey-goodness - and otherwise.
Comb.
Peter Allen, Graham R. Brightwell, Jozef Skokan
2012 J jnl
Monochromatic Cycles in 2-Coloured Graphs.
Comb. Probab. Comput.
Fabrício Siqueira Benevides, Tomasz Luczak, Alex Scott, Jozef Skokan, M. White
2012 J jnl
On the multi-colored Ramsey numbers of cycles.
J. Graph Theory
Tomasz Luczak, Miklós Simonovits, Jozef Skokan
2009 J jnl
Asymmetric Ramsey properties of random graphs involving cliques.
Random Struct. Algorithms
Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger
2009 J jnl
The 3-colored Ramsey number of even cycles.
J. Comb. Theory B
Fabrício Siqueira Benevides, Jozef Skokan
2009 J jnl
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Comb. Probab. Comput.
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan
2007 J jnl
Tree representations of graphs.
Eur. J. Comb.
Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan
2007 J jnl
Turán's theorem for pseudo-random graphs.
J. Comb. Theory A
Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan
2006 J jnl
Applications of the regularity lemma for uniform hypergraphs.
Random Struct. Algorithms
Vojtech Rödl, Jozef Skokan
2006 J jnl
The Ramsey number for hypergraph cycles I.
J. Comb. Theory A
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan
2006 — conf
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques.
APPROX-RANDOM
Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger
2006 J jnl
Transversal numbers of translates of a convex body.
Discret. Math.
Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan
2005 J jnl
Counting Small Cliques in 3-uniform Hypergraphs.
Comb. Probab. Comput.
Yuejian Peng, Vojtech Rödl, Jozef Skokan
2005 J jnl
Counting subgraphs in quasi-random 4-uniform hypergraphs.
Random Struct. Algorithms
Vojtech Rödl, Jozef Skokan
2005 J jnl
The 3-colored Ramsey number of odd cycles.
Electron. Notes Discret. Math.
Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan
2004 J jnl
Bipartite Subgraphs and Quasi-Randomness.
Graphs Comb.
Jozef Skokan, Lubos Thoma
2004 J jnl
Regularity Lemma for k-uniform hypergraphs.
Random Struct. Algorithms
Vojtech Rödl, Jozef Skokan
2002 J jnl
Hypergraphs, Quasi-randomness, and Conditions for Regularity.
J. Comb. Theory A
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
2000 B conf
Equivalent Conditions for Regularity (Extended Abstract).
LATIN
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan