Jozef Skokan

According to our database1, Jozef Skokan authored at least 29 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
The number of hypergraphs without linear cycles.
J. Comb. Theory, Ser. B, 2019

2017
An Asymptotic Multipartite Kühn-Osthus Theorem.
SIAM J. Discrete Math., 2017

Asymptotic multipartite version of the Alon-Yuster theorem.
J. Comb. Theory, Ser. B, 2017

Decomposing tournaments into paths.
Electronic Notes in Discrete Mathematics, 2017

Stability for Vertex Cycle Covers.
Electr. J. Comb., 2017

2016
On the Ramsey number of the triangle and the cube.
Combinatorica, 2016

2015
Ramsey Numbers of Squares of Paths.
Electronic Notes in Discrete Mathematics, 2015

2014
The Ramsey number of the clique and the hypercube.
J. London Math. Society, 2014

Cycles Are Strongly Ramsey-Unsaturated.
Combinatorics, Probability & Computing, 2014

2013
Maximum Planar Subgraphs in Dense Graphs.
Electr. J. Comb., 2013

Ramsey-goodness - and otherwise.
Combinatorica, 2013

2012
On the multi-colored Ramsey numbers of cycles.
Journal of Graph Theory, 2012

Monochromatic Cycles in 2-Coloured Graphs.
Combinatorics, Probability & Computing, 2012

2009
Asymmetric Ramsey properties of random graphs involving cliques.
Random Struct. Algorithms, 2009

The 3-colored Ramsey number of even cycles.
J. Comb. Theory, Ser. B, 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Combinatorics, Probability & Computing, 2009

2007
Turán's theorem for pseudo-random graphs.
J. Comb. Theory, Ser. A, 2007

Tree representations of graphs.
Eur. J. Comb., 2007

2006
Applications of the regularity lemma for uniform hypergraphs.
Random Struct. Algorithms, 2006

The Ramsey number for hypergraph cycles I.
J. Comb. Theory, Ser. A, 2006

Transversal numbers of translates of a convex body.
Discrete Mathematics, 2006

Threshold Functions for Asymmetric Ramsey Properties Involving Cliques.
Proceedings of the Approximation, 2006

2005
Counting subgraphs in quasi-random 4-uniform hypergraphs.
Random Struct. Algorithms, 2005

The 3-colored Ramsey number of odd cycles.
Electronic Notes in Discrete Mathematics, 2005

Counting Small Cliques in 3-uniform Hypergraphs.
Combinatorics, Probability & Computing, 2005

2004
Regularity Lemma for k-uniform hypergraphs.
Random Struct. Algorithms, 2004

Bipartite Subgraphs and Quasi-Randomness.
Graphs and Combinatorics, 2004

2002
Hypergraphs, Quasi-randomness, and Conditions for Regularity.
J. Comb. Theory, Ser. A, 2002

2000
Equivalent Conditions for Regularity (Extended Abstract).
Proceedings of the LATIN 2000: Theoretical Informatics, 2000


  Loading...